Base | Representation |
---|---|
bin | 1001011000101110001100… |
… | …1100000000010011101110 |
3 | 1100112121120001111122222110 |
4 | 2112023203030000103232 |
5 | 2323042010143120024 |
6 | 33541031351024450 |
7 | 2113422140161110 |
oct | 226134314002356 |
9 | 40477501448873 |
10 | 10320323020014 |
11 | 3319908327027 |
12 | 11a819336b126 |
13 | 59b28255c757 |
14 | 2797133dd3b0 |
15 | 12d6c68c7629 |
hex | 962e33004ee |
10320323020014 has 128 divisors (see below), whose sum is σ = 23914776960000. Its totient is φ = 2908306787328.
The previous prime is 10320323020003. The next prime is 10320323020037. The reversal of 10320323020014 is 41002032302301.
It is a Harshad number since it is a multiple of its sum of digits (21).
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 63 ways as a sum of consecutive naturals, for example, 821087122 + ... + 821099690.
It is an arithmetic number, because the mean of its divisors is an integer number (186834195000).
Almost surely, 210320323020014 is an apocalyptic number.
10320323020014 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
10320323020014 is an abundant number, since it is smaller than the sum of its proper divisors (13594453939986).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10320323020014 is a wasteful number, since it uses less digits than its factorization.
10320323020014 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13642.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 10320323020014 its reverse (41002032302301), we get a palindrome (51322355322315).
The spelling of 10320323020014 in words is "ten trillion, three hundred twenty billion, three hundred twenty-three million, twenty thousand, fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •