Base | Representation |
---|---|
bin | 110000011101010110100011… |
… | …010100010010100101000001 |
3 | 1000221121101112001210101120110 |
4 | 300131112203110102211001 |
5 | 210413303020410400001 |
6 | 2033135255322301533 |
7 | 62614436232435330 |
oct | 6035264324224501 |
9 | 1027541461711513 |
10 | 213123312200001 |
11 | 619a90a8695035 |
12 | 1baa08860578a9 |
13 | 91bc5993c59c8 |
14 | 3a8b31ac25d17 |
15 | 1998c5e38e3d6 |
hex | c1d5a3512941 |
213123312200001 has 32 divisors (see below), whose sum is σ = 341853766374400. Its totient is φ = 115374406155840.
The previous prime is 213123312199999. The next prime is 213123312200033. The reversal of 213123312200001 is 100002213321312.
It is not a de Polignac number, because 213123312200001 - 21 = 213123312199999 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (213123312200101) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 78476406 + ... + 81146736.
It is an arithmetic number, because the mean of its divisors is an integer number (10682930199200).
Almost surely, 2213123312200001 is an apocalyptic number.
213123312200001 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
213123312200001 is a deficient number, since it is larger than the sum of its proper divisors (128730454174399).
213123312200001 is a wasteful number, since it uses less digits than its factorization.
213123312200001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2870389.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 213123312200001 its reverse (100002213321312), we get a palindrome (313125525521313).
The spelling of 213123312200001 in words is "two hundred thirteen trillion, one hundred twenty-three billion, three hundred twelve million, two hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •