Base | Representation |
---|---|
bin | 1011110110000011100100… |
… | …1111001001010100100001 |
3 | 1201010000102020122201102011 |
4 | 2331200321033021110201 |
5 | 3201333210041104441 |
6 | 43410453312152521 |
7 | 2512621353654655 |
oct | 275407117112441 |
9 | 51100366581364 |
10 | 13023301113121 |
11 | 4171172a63982 |
12 | 1564005238741 |
13 | 736127244c10 |
14 | 33048c8d6a65 |
15 | 178b75125581 |
hex | bd8393c9521 |
13023301113121 has 8 divisors (see below), whose sum is σ = 14351258472320. Its totient is φ = 11741938749072.
The previous prime is 13023301113107. The next prime is 13023301113133. The reversal of 13023301113121 is 12131110332031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13023301113121 - 217 = 13023300982049 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13023301113092 and 13023301113101.
It is not an unprimeable number, because it can be changed into a prime (13023301113101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11648748201 + ... + 11648749318.
It is an arithmetic number, because the mean of its divisors is an integer number (1793907309040).
Almost surely, 213023301113121 is an apocalyptic number.
It is an amenable number.
13023301113121 is a deficient number, since it is larger than the sum of its proper divisors (1327957359199).
13023301113121 is a wasteful number, since it uses less digits than its factorization.
13023301113121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23297497575.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 13023301113121 its reverse (12131110332031), we get a palindrome (25154411445152).
The spelling of 13023301113121 in words is "thirteen trillion, twenty-three billion, three hundred one million, one hundred thirteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •