Base | Representation |
---|---|
bin | 1001000110111111001101… |
… | …00001101110001110010100 |
3 | 2121220222021202010101100012 |
4 | 10203133212201232032110 |
5 | 10111143100311213022 |
6 | 110334130251535352 |
7 | 4135133201341454 |
oct | 443374641561624 |
9 | 77828252111305 |
10 | 20031300101012 |
11 | 6423254768212 |
12 | 22b6249a5a558 |
13 | b23c35b1aa75 |
14 | 4d373d211d64 |
15 | 24b0d7bbede2 |
hex | 1237e686e394 |
20031300101012 has 6 divisors (see below), whose sum is σ = 35054775176778. Its totient is φ = 10015650050504.
The previous prime is 20031300100993. The next prime is 20031300101143. The reversal of 20031300101012 is 21010100313002.
It can be written as a sum of positive squares in only one way, i.e., 10214646113296 + 9816653987716 = 3196036^2 + 3133154^2 .
It is a super-2 number, since 2×200313001010122 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
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 as a sum of consecutive naturals, namely, 2503912512623 + ... + 2503912512630.
It is an arithmetic number, because the mean of its divisors is an integer number (5842462529463).
Almost surely, 220031300101012 is an apocalyptic number.
It is an amenable number.
20031300101012 is a deficient number, since it is larger than the sum of its proper divisors (15023475075766).
20031300101012 is a wasteful number, since it uses less digits than its factorization.
20031300101012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5007825025257 (or 5007825025255 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 20031300101012 its reverse (21010100313002), we get a palindrome (41041400414014).
The spelling of 20031300101012 in words is "twenty trillion, thirty-one billion, three hundred million, one hundred one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •