Base | Representation |
---|---|
bin | 1001011000011000010000… |
… | …1100011100010110000000 |
3 | 1100112001100122220022200120 |
4 | 2112012010030130112000 |
5 | 2322442430142111112 |
6 | 33534215152020240 |
7 | 2113123204150425 |
oct | 226060414342600 |
9 | 40461318808616 |
10 | 10314434332032 |
11 | 3317366313646 |
12 | 11a700b231680 |
13 | 59a8545682ac |
14 | 2793152c7d4c |
15 | 12d47e92ae8c |
hex | 9618431c580 |
10314434332032 has 64 divisors (see below), whose sum is σ = 29009346577200. Its totient is φ = 3235900964864.
The previous prime is 10314434332019. The next prime is 10314434332063. The reversal of 10314434332032 is 23023343441301.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (64).
It is a junction number, because it is equal to n+sod(n) for n = 10314434331984 and 10314434332002.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 790008357 + ... + 790021412.
Almost surely, 210314434332032 is an apocalyptic number.
10314434332032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10314434332032 is an abundant number, since it is smaller than the sum of its proper divisors (18694912245168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10314434332032 is a wasteful number, since it uses less digits than its factorization.
10314434332032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1580029803 (or 1580029791 counting only the distinct ones).
The product of its (nonzero) digits is 62208, while the sum is 33.
Adding to 10314434332032 its reverse (23023343441301), we get a palindrome (33337777773333).
The spelling of 10314434332032 in words is "ten trillion, three hundred fourteen billion, four hundred thirty-four million, three hundred thirty-two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •