Base | Representation |
---|---|
bin | 1011111011001110000000… |
… | …1110100100000001001011 |
3 | 1201102111100222012210100102 |
4 | 2332303200032210001023 |
5 | 3204311340014220243 |
6 | 43515323130200015 |
7 | 2522211430635056 |
oct | 276634016440113 |
9 | 51374328183312 |
10 | 13112002101323 |
11 | 41a58503a21a4 |
12 | 157923ab8300b |
13 | 7415c1bb6c58 |
14 | 3348a508da9d |
15 | 17b1174099b8 |
hex | bece03a404b |
13112002101323 has 8 divisors (see below), whose sum is σ = 13318786857600. Its totient is φ = 12906538653888.
The previous prime is 13112002101299. The next prime is 13112002101389. The reversal of 13112002101323 is 32310120021131.
It is a happy number.
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 13112002101323 - 28 = 13112002101067 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13112002101295 and 13112002101304.
It is not an unprimeable number, because it can be changed into a prime (13112002101923) 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, 330307208 + ... + 330346901.
It is an arithmetic number, because the mean of its divisors is an integer number (1664848357200).
Almost surely, 213112002101323 is an apocalyptic number.
13112002101323 is a deficient number, since it is larger than the sum of its proper divisors (206784756277).
13112002101323 is an equidigital number, since it uses as much as digits as its factorization.
13112002101323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 660654421.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 13112002101323 its reverse (32310120021131), we get a palindrome (45422122122454).
The spelling of 13112002101323 in words is "thirteen trillion, one hundred twelve billion, two million, one hundred one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •