Base | Representation |
---|---|
bin | 101001110000110… |
… | …1101000011011111 |
3 | 10121122212122212220 |
4 | 1103201231003133 |
5 | 10332221003343 |
6 | 351015400423 |
7 | 46504141446 |
oct | 12341550337 |
9 | 3548778786 |
10 | 1401344223 |
11 | 65a027724 |
12 | 331383113 |
13 | 19442c586 |
14 | d4181d5d |
15 | 8305d183 |
hex | 5386d0df |
1401344223 has 8 divisors (see below), whose sum is σ = 1900128000. Its totient is φ = 918394968.
The previous prime is 1401344213. The next prime is 1401344257. The reversal of 1401344223 is 3224431041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1401344223 - 213 = 1401336031 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1401344193 and 1401344202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1401344213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3958423 + ... + 3958776.
It is an arithmetic number, because the mean of its divisors is an integer number (237516000).
Almost surely, 21401344223 is an apocalyptic number.
1401344223 is a deficient number, since it is larger than the sum of its proper divisors (498783777).
1401344223 is an equidigital number, since it uses as much as digits as its factorization.
1401344223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7917261.
The product of its (nonzero) digits is 2304, while the sum is 24.
The square root of 1401344223 is about 37434.5324934077. The cubic root of 1401344223 is about 1119.0468674092.
Adding to 1401344223 its reverse (3224431041), we get a palindrome (4625775264).
The spelling of 1401344223 in words is "one billion, four hundred one million, three hundred forty-four thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •