Base | Representation |
---|---|
bin | 1001011101110000111000… |
… | …1100101000111110000010 |
3 | 1100211220010211001222021010 |
4 | 2113130032030220332002 |
5 | 2331001410122442040 |
6 | 34044514542141350 |
7 | 2122606526022501 |
oct | 227341614507602 |
9 | 40756124058233 |
10 | 10406943952770 |
11 | 3352618609962 |
12 | 1200b28581856 |
13 | 5a64a82a7a51 |
14 | 27d9ad61c838 |
15 | 130a96283e80 |
hex | 9770e328f82 |
10406943952770 has 64 divisors (see below), whose sum is σ = 25976494076544. Its totient is φ = 2666209029120.
The previous prime is 10406943952697. The next prime is 10406943952793. The reversal of 10406943952770 is 7725934960401.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 10406943952770.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 66047527 + ... + 66204906.
It is an arithmetic number, because the mean of its divisors is an integer number (405882719946).
Almost surely, 210406943952770 is an apocalyptic number.
10406943952770 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10406943952770 is an abundant number, since it is smaller than the sum of its proper divisors (15569550123774).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10406943952770 is a wasteful number, since it uses less digits than its factorization.
10406943952770 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132252547.
The product of its (nonzero) digits is 11430720, while the sum is 57.
The spelling of 10406943952770 in words is "ten trillion, four hundred six billion, nine hundred forty-three million, nine hundred fifty-two thousand, seven hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.121 sec. • engine limits •