Base | Representation |
---|---|
bin | 100100101110010111100110… |
… | …0010100000001010111101010 |
3 | 1120100202120121100022101211010 |
4 | 1021130233030110001113222 |
5 | 314320024433023200020 |
6 | 3103010541112244350 |
7 | 125020210243554411 |
oct | 11134571424012752 |
9 | 1510676540271733 |
10 | 323032213100010 |
11 | 93a23212954037 |
12 | 302919826a06b6 |
13 | 10b32a64c4aa6b |
14 | 59aabb1cc2478 |
15 | 2752c20ebade0 |
hex | 125cbcc5015ea |
323032213100010 has 64 divisors (see below), whose sum is σ = 784024626378240. Its totient is φ = 85170089326080.
The previous prime is 323032213099969. The next prime is 323032213100021. The reversal of 323032213100010 is 10001312230323.
It is a self number, because there is not a number n which added to its sum of digits gives 323032213100010.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 55042159 + ... + 60627581.
It is an arithmetic number, because the mean of its divisors is an integer number (12250384787160).
Almost surely, 2323032213100010 is an apocalyptic number.
323032213100010 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
323032213100010 is an abundant number, since it is smaller than the sum of its proper divisors (460992413278230).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
323032213100010 is a wasteful number, since it uses less digits than its factorization.
323032213100010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5607183.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 323032213100010 its reverse (10001312230323), we get a palindrome (333033525330333).
The spelling of 323032213100010 in words is "three hundred twenty-three trillion, thirty-two billion, two hundred thirteen million, one hundred thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •