Base | Representation |
---|---|
bin | 1001011101011110111001… |
… | …0111110001011111011011 |
3 | 1100211102200021121102201122 |
4 | 2113113232113301133123 |
5 | 2330412012422024201 |
6 | 34042355441435455 |
7 | 2122346051623400 |
oct | 227275627613733 |
9 | 40742607542648 |
10 | 10402115033051 |
11 | 335056a832015 |
12 | 11bbbbb33bb8b |
13 | 5a5bb8a190c1 |
14 | 27d6721722a7 |
15 | 1308b2372e1b |
hex | 975ee5f17db |
10402115033051 has 24 divisors (see below), whose sum is σ = 12223489880160. Its totient is φ = 8825462352000.
The previous prime is 10402115033003. The next prime is 10402115033083. The reversal of 10402115033051 is 15033051120401.
It is not a de Polignac number, because 10402115033051 - 238 = 10127237126107 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10402115033051.
It is not an unprimeable number, because it can be changed into a prime (10402115039051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 18373946 + ... + 18931616.
It is an arithmetic number, because the mean of its divisors is an integer number (509312078340).
Almost surely, 210402115033051 is an apocalyptic number.
10402115033051 is a deficient number, since it is larger than the sum of its proper divisors (1821374847109).
10402115033051 is a wasteful number, since it uses less digits than its factorization.
10402115033051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 561555 (or 561548 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 26.
Adding to 10402115033051 its reverse (15033051120401), we get a palindrome (25435166153452).
The spelling of 10402115033051 in words is "ten trillion, four hundred two billion, one hundred fifteen million, thirty-three thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •