Base | Representation |
---|---|
bin | 1011110101011010010110… |
… | …0010000110111010001111 |
3 | 1201001221211220021111002201 |
4 | 2331112211202012322033 |
5 | 3201143023134341143 |
6 | 43401423134502331 |
7 | 2512050160411414 |
oct | 275264542067217 |
9 | 51057756244081 |
10 | 13012233121423 |
11 | 41675034069a8 |
12 | 1561a366649a7 |
13 | 735082202bc3 |
14 | 32db1c9a810b |
15 | 17872860564d |
hex | bd5a5886e8f |
13012233121423 has 4 divisors (see below), whose sum is σ = 13012244975880. Its totient is φ = 13012221266968.
The previous prime is 13012233121351. The next prime is 13012233121501. The reversal of 13012233121423 is 32412133221031.
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 13012233121423 - 29 = 13012233120911 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13012233121391 and 13012233121400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13012233127423) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4091140 + ... + 6539257.
It is an arithmetic number, because the mean of its divisors is an integer number (3253061243970).
Almost surely, 213012233121423 is an apocalyptic number.
13012233121423 is a deficient number, since it is larger than the sum of its proper divisors (11854457).
13012233121423 is a wasteful number, since it uses less digits than its factorization.
13012233121423 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11854456.
The product of its (nonzero) digits is 5184, while the sum is 28.
Adding to 13012233121423 its reverse (32412133221031), we get a palindrome (45424366342454).
The spelling of 13012233121423 in words is "thirteen trillion, twelve billion, two hundred thirty-three million, one hundred twenty-one thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •