Base | Representation |
---|---|
bin | 101111110000010110111010… |
… | …110101100001001010001011 |
3 | 1000112122210120112102011000110 |
4 | 233300112322311201022023 |
5 | 210012123131031131243 |
6 | 2022411021112205403 |
7 | 62145156106265562 |
oct | 5760267265411213 |
9 | 1015583515364013 |
10 | 210031330333323 |
11 | 60a16872516524 |
12 | 1b68158b699863 |
13 | 9026b3c2a8075 |
14 | 39c17dbb36bd9 |
15 | 19435e47dde33 |
hex | bf05bad6128b |
210031330333323 has 24 divisors (see below), whose sum is σ = 286460140939200. Its totient is φ = 136878669006256.
The previous prime is 210031330333261. The next prime is 210031330333333. The reversal of 210031330333323 is 323333033130012.
It is a happy number.
It is not a de Polignac number, because 210031330333323 - 217 = 210031330202251 is a prime.
It is a super-2 number, since 2×2100313303333232 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (210031330333333) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 54309933 + ... + 58048526.
It is an arithmetic number, because the mean of its divisors is an integer number (11935839205800).
Almost surely, 2210031330333323 is an apocalyptic number.
210031330333323 is a deficient number, since it is larger than the sum of its proper divisors (76428810605877).
210031330333323 is a wasteful number, since it uses less digits than its factorization.
210031330333323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112358759 (or 112358700 counting only the distinct ones).
The product of its (nonzero) digits is 26244, while the sum is 30.
Adding to 210031330333323 its reverse (323333033130012), we get a palindrome (533364363463335).
The spelling of 210031330333323 in words is "two hundred ten trillion, thirty-one billion, three hundred thirty million, three hundred thirty-three thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •