Base | Representation |
---|---|
bin | 1100000111011001011000… |
… | …0000001111010100000111 |
3 | 1202011111101001012212202112 |
4 | 3001312112000033110013 |
5 | 3221223314304330043 |
6 | 44155402434331235 |
7 | 2543266002454253 |
oct | 301662600172407 |
9 | 52144331185675 |
10 | 13321210230023 |
11 | 4276547989813 |
12 | 15b18a6429b1b |
13 | 758252b28597 |
14 | 340a70083263 |
15 | 1817ade6d518 |
hex | c1d9600f507 |
13321210230023 has 4 divisors (see below), whose sum is σ = 13750926689088. Its totient is φ = 12891493770960.
The previous prime is 13321210230007. The next prime is 13321210230113. The reversal of 13321210230023 is 32003201212331.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13321210230023 - 24 = 13321210230007 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13321210239023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 214858229486 + ... + 214858229547.
It is an arithmetic number, because the mean of its divisors is an integer number (3437731672272).
Almost surely, 213321210230023 is an apocalyptic number.
13321210230023 is a deficient number, since it is larger than the sum of its proper divisors (429716459065).
13321210230023 is an equidigital number, since it uses as much as digits as its factorization.
13321210230023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 429716459064.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 13321210230023 its reverse (32003201212331), we get a palindrome (45324411442354).
The spelling of 13321210230023 in words is "thirteen trillion, three hundred twenty-one billion, two hundred ten million, two hundred thirty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.951 sec. • engine limits •