Base | Representation |
---|---|
bin | 1010111011010000010111… |
… | …0100010100111101001001 |
3 | 1120112102222001210120210211 |
4 | 2232310011310110331021 |
5 | 3033310333002132223 |
6 | 41314430205241121 |
7 | 2346630224536522 |
oct | 256640564247511 |
9 | 46472861716724 |
10 | 12013121130313 |
11 | 3911810773256 |
12 | 1420281b631a1 |
13 | 691aa8bc2b14 |
14 | 2d761c479849 |
15 | 15c74ececd0d |
hex | aed05d14f49 |
12013121130313 has 2 divisors, whose sum is σ = 12013121130314. Its totient is φ = 12013121130312.
The previous prime is 12013121130281. The next prime is 12013121130317. The reversal of 12013121130313 is 31303112131021.
12013121130313 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9398344811584 + 2614776318729 = 3065672^2 + 1617027^2 .
It is a cyclic number.
It is not a de Polignac number, because 12013121130313 - 25 = 12013121130281 is a prime.
It is not a weakly prime, because it can be changed into another prime (12013121130317) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6006560565156 + 6006560565157.
It is an arithmetic number, because the mean of its divisors is an integer number (6006560565157).
Almost surely, 212013121130313 is an apocalyptic number.
It is an amenable number.
12013121130313 is a deficient number, since it is larger than the sum of its proper divisors (1).
12013121130313 is an equidigital number, since it uses as much as digits as its factorization.
12013121130313 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 12013121130313 its reverse (31303112131021), we get a palindrome (43316233261334).
The spelling of 12013121130313 in words is "twelve trillion, thirteen billion, one hundred twenty-one million, one hundred thirty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •