Base | Representation |
---|---|
bin | 11000010000100001… |
… | …01111111111010001 |
3 | 1020121122000212210001 |
4 | 30020100233333101 |
5 | 203133004313411 |
6 | 5552151010001 |
7 | 640510004212 |
oct | 141020577721 |
9 | 36548025701 |
10 | 13023510481 |
11 | 5583483203 |
12 | 2635669901 |
13 | 12c7213c27 |
14 | 8b7929409 |
15 | 513547dc1 |
hex | 30842ffd1 |
13023510481 has 2 divisors, whose sum is σ = 13023510482. Its totient is φ = 13023510480.
The previous prime is 13023510473. The next prime is 13023510517. The reversal of 13023510481 is 18401532031.
It is a happy number.
13023510481 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11719145025 + 1304365456 = 108255^2 + 36116^2 .
It is a cyclic number.
It is not a de Polignac number, because 13023510481 - 23 = 13023510473 is a prime.
It is a super-2 number, since 2×130235104812 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13023510421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6511755240 + 6511755241.
It is an arithmetic number, because the mean of its divisors is an integer number (6511755241).
Almost surely, 213023510481 is an apocalyptic number.
It is an amenable number.
13023510481 is a deficient number, since it is larger than the sum of its proper divisors (1).
13023510481 is an equidigital number, since it uses as much as digits as its factorization.
13023510481 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2880, while the sum is 28.
The spelling of 13023510481 in words is "thirteen billion, twenty-three million, five hundred ten thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •