Base | Representation |
---|---|
bin | 1011110101010010000111… |
… | …0011101000100110000011 |
3 | 1201001202010212202221122112 |
4 | 2331110201303220212003 |
5 | 3201124011404421311 |
6 | 43400415550525535 |
7 | 2511641333631323 |
oct | 275244163504603 |
9 | 51052125687575 |
10 | 13010023123331 |
11 | 41665799786a3 |
12 | 156151a5068ab |
13 | 734abc3b0820 |
14 | 32d98d287283 |
15 | 1786495b128b |
hex | bd521ce8983 |
13010023123331 has 16 divisors (see below), whose sum is σ = 14888514370464. Its totient is φ = 11262021041664.
The previous prime is 13010023123313. The next prime is 13010023123333. The reversal of 13010023123331 is 13332132001031.
It is a cyclic number.
It is not a de Polignac number, because 13010023123331 - 226 = 13009956014467 is a prime.
It is a super-2 number, since 2×130100231233312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13010023123297 and 13010023123306.
It is not an unprimeable number, because it can be changed into a prime (13010023123333) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 106200305 + ... + 106322738.
It is an arithmetic number, because the mean of its divisors is an integer number (930532148154).
Almost surely, 213010023123331 is an apocalyptic number.
13010023123331 is a deficient number, since it is larger than the sum of its proper divisors (1878491247133).
13010023123331 is a wasteful number, since it uses less digits than its factorization.
13010023123331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 212523350.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 13010023123331 its reverse (13332132001031), we get a palindrome (26342155124362).
The spelling of 13010023123331 in words is "thirteen trillion, ten billion, twenty-three million, one hundred twenty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •