Base | Representation |
---|---|
bin | 1001000110000101000001… |
… | …1110010111010110000110 |
3 | 1022101222211120012202020012 |
4 | 2101201100132113112012 |
5 | 2302320032201033220 |
6 | 33133541401510222 |
7 | 2051323110352352 |
oct | 221412036272606 |
9 | 38358746182205 |
10 | 10000034002310 |
11 | 3205a99548500 |
12 | 11560a71a2372 |
13 | 576ccb202131 |
14 | 26800b860462 |
15 | 1251cce0cac5 |
hex | 91850797586 |
10000034002310 has 192 divisors, whose sum is σ = 20709017763840. Its totient is φ = 3469982630400.
The previous prime is 10000034002297. The next prime is 10000034002327. The reversal of 10000034002310 is 1320043000001.
It is a super-2 number, since 2×100000340023102 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 2912912354 + ... + 2912915786.
It is an arithmetic number, because the mean of its divisors is an integer number (107859467520).
Almost surely, 210000034002310 is an apocalyptic number.
10000034002310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10000034002310 is an abundant number, since it is smaller than the sum of its proper divisors (10708983761530).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10000034002310 is a wasteful number, since it uses less digits than its factorization.
10000034002310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4555 (or 4544 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 14.
Adding to 10000034002310 its reverse (1320043000001), we get a palindrome (11320077002311).
The spelling of 10000034002310 in words is "ten trillion, thirty-four million, two thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •