Base | Representation |
---|---|
bin | 10100011001101110010… |
… | …011110111101011000101 |
3 | 11222000211111020110101220 |
4 | 110121232103313223011 |
5 | 140432304032303104 |
6 | 2552024032510553 |
7 | 203202054501663 |
oct | 24315623675305 |
9 | 4860744213356 |
10 | 1402010041029 |
11 | 4a0653132924 |
12 | 1a78763ab459 |
13 | a2294188670 |
14 | 4bc01559c33 |
15 | 267098577d9 |
hex | 1466e4f7ac5 |
1402010041029 has 8 divisors (see below), whose sum is σ = 2013142623072. Its totient is φ = 862775409840.
The previous prime is 1402010040989. The next prime is 1402010041039. The reversal of 1402010041029 is 9201400102041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1402010041029 - 213 = 1402010032837 is a prime.
It is a super-2 number, since 2×14020100410292 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1402010041039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17974487667 + ... + 17974487744.
It is an arithmetic number, because the mean of its divisors is an integer number (251642827884).
Almost surely, 21402010041029 is an apocalyptic number.
It is an amenable number.
1402010041029 is a deficient number, since it is larger than the sum of its proper divisors (611132582043).
1402010041029 is a wasteful number, since it uses less digits than its factorization.
1402010041029 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35948975427.
The product of its (nonzero) digits is 576, while the sum is 24.
The spelling of 1402010041029 in words is "one trillion, four hundred two billion, ten million, forty-one thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •