Base | Representation |
---|---|
bin | 1001101001111000010101… |
… | …00010010100000011010000 |
3 | 2210011120212011000020010101 |
4 | 10310330022202110003100 |
5 | 10240313422212030222 |
6 | 113053004055542144 |
7 | 4320555102313453 |
oct | 464741242240320 |
9 | 83146764006111 |
10 | 21230200111312 |
11 | 684574a546805 |
12 | 246a67b08a954 |
13 | bacccb55969a |
14 | 53579360149a |
15 | 26c3a6027927 |
hex | 134f0a8940d0 |
21230200111312 has 20 divisors (see below), whose sum is σ = 42090106036000. Its totient is φ = 10368237263328.
The previous prime is 21230200111301. The next prime is 21230200111399. The reversal of 21230200111312 is 21311100203212.
It is a super-2 number, since 2×212302001113122 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 21230200111312.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15428923812 + ... + 15428925187.
It is an arithmetic number, because the mean of its divisors is an integer number (2104505301800).
Almost surely, 221230200111312 is an apocalyptic number.
It is an amenable number.
21230200111312 is a deficient number, since it is larger than the sum of its proper divisors (20859905924688).
21230200111312 is a wasteful number, since it uses less digits than its factorization.
21230200111312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30857849050 (or 30857849044 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 21230200111312 its reverse (21311100203212), we get a palindrome (42541300314524).
The spelling of 21230200111312 in words is "twenty-one trillion, two hundred thirty billion, two hundred million, one hundred eleven thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •