Base | Representation |
---|---|
bin | 1011110110000011100111… |
… | …0101010000000010110010 |
3 | 1201010000102221110012202110 |
4 | 2331200321311100002302 |
5 | 3201333220120232010 |
6 | 43410454310230150 |
7 | 2512621534610310 |
oct | 275407165200262 |
9 | 51100387405673 |
10 | 13023311102130 |
11 | 417117866685a |
12 | 1564008655356 |
13 | 736129331784 |
14 | 33048dd770b0 |
15 | 178b75e4a120 |
hex | bd839d500b2 |
13023311102130 has 32 divisors (see below), whose sum is σ = 35721081880704. Its totient is φ = 2976756823296.
The previous prime is 13023311102057. The next prime is 13023311102149. The reversal of 13023311102130 is 3120111332031.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 13023311102097 and 13023311102106.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 31007883367 + ... + 31007883786.
It is an arithmetic number, because the mean of its divisors is an integer number (1116283808772).
Almost surely, 213023311102130 is an apocalyptic number.
13023311102130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13023311102130 is an abundant number, since it is smaller than the sum of its proper divisors (22697770778574).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13023311102130 is a wasteful number, since it uses less digits than its factorization.
13023311102130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 62015767170.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 13023311102130 its reverse (3120111332031), we get a palindrome (16143422434161).
The spelling of 13023311102130 in words is "thirteen trillion, twenty-three billion, three hundred eleven million, one hundred two thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •