Base | Representation |
---|---|
bin | 1010111011101010011110… |
… | …0110001110111101011111 |
3 | 1120120010001112210220112201 |
4 | 2232322213212032331133 |
5 | 3033414211324441111 |
6 | 41321545512312331 |
7 | 2350266014566612 |
oct | 256724746167537 |
9 | 46503045726481 |
10 | 12020130312031 |
11 | 3914788219216 |
12 | 14216b93a26a7 |
13 | 69265509201a |
14 | 2d7ac5306179 |
15 | 15ca1032c6c1 |
hex | aeea798ef5f |
12020130312031 has 16 divisors (see below), whose sum is σ = 13239619192800. Its totient is φ = 10861935981568.
The previous prime is 12020130312023. The next prime is 12020130312041. The reversal of 12020130312031 is 13021303102021.
It is a cyclic number.
It is not a de Polignac number, because 12020130312031 - 23 = 12020130312023 is a prime.
It is a super-2 number, since 2×120201303120312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12020130312041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 68016790 + ... + 68193283.
It is an arithmetic number, because the mean of its divisors is an integer number (827476199550).
Almost surely, 212020130312031 is an apocalyptic number.
12020130312031 is a deficient number, since it is larger than the sum of its proper divisors (1219488880769).
12020130312031 is a wasteful number, since it uses less digits than its factorization.
12020130312031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136210298.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 12020130312031 its reverse (13021303102021), we get a palindrome (25041433414052).
The spelling of 12020130312031 in words is "twelve trillion, twenty billion, one hundred thirty million, three hundred twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •