Base | Representation |
---|---|
bin | 101111110100011100010100… |
… | …110010010010111011101100 |
3 | 1000120122122001202002000210110 |
4 | 233310130110302102323230 |
5 | 210031223000122443200 |
6 | 2023144001001140020 |
7 | 62204353502611233 |
oct | 5764342462227354 |
9 | 1016578052060713 |
10 | 210312012312300 |
11 | 61014907144698 |
12 | 1b707a6348a610 |
13 | 9047450acb9b2 |
14 | 39d1227399b1a |
15 | 194aa71044b50 |
hex | bf4714c92eec |
210312012312300 has 144 divisors (see below), whose sum is σ = 646024379105952. Its totient is φ = 52642678272000.
The previous prime is 210312012312251. The next prime is 210312012312323. The reversal of 210312012312300 is 3213210213012.
It is a super-2 number, since 2×2103120123123002 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 53376051 + ... + 57180650.
It is an arithmetic number, because the mean of its divisors is an integer number (4486280410458).
Almost surely, 2210312012312300 is an apocalyptic number.
210312012312300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
210312012312300 is an abundant number, since it is smaller than the sum of its proper divisors (435712366793652).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210312012312300 is a wasteful number, since it uses less digits than its factorization.
210312012312300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 110557108 (or 110557101 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 210312012312300 its reverse (3213210213012), we get a palindrome (213525222525312).
The spelling of 210312012312300 in words is "two hundred ten trillion, three hundred twelve billion, twelve million, three hundred twelve thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •