Base | Representation |
---|---|
bin | 1011110100110001101110… |
… | …1010011101101000000111 |
3 | 1201000220201001100200120111 |
4 | 2331030123222131220013 |
5 | 3201003211002334343 |
6 | 43352421213413451 |
7 | 2511213036424003 |
oct | 275143352355007 |
9 | 51026631320514 |
10 | 13001330121223 |
11 | 4162918a00534 |
12 | 155b8b319a287 |
13 | 73403540b5b2 |
14 | 32d3a6947703 |
15 | 1782db326c9d |
hex | bd31ba9da07 |
13001330121223 has 8 divisors (see below), whose sum is σ = 13210394875776. Its totient is φ = 12793513515000.
The previous prime is 13001330121173. The next prime is 13001330121253. The reversal of 13001330121223 is 32212103310031.
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 13001330121223 - 217 = 13001329990151 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13001330121194 and 13001330121203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13001330121253) 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, 312016083 + ... + 312057748.
It is an arithmetic number, because the mean of its divisors is an integer number (1651299359472).
Almost surely, 213001330121223 is an apocalyptic number.
13001330121223 is a deficient number, since it is larger than the sum of its proper divisors (209064754553).
13001330121223 is an equidigital number, since it uses as much as digits as its factorization.
13001330121223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 624074165.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 13001330121223 its reverse (32212103310031), we get a palindrome (45213433431254).
The spelling of 13001330121223 in words is "thirteen trillion, one billion, three hundred thirty million, one hundred twenty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •