Base | Representation |
---|---|
bin | 1011111011101111111010… |
… | …0001000110000001111100 |
3 | 1201110100212000220121120120 |
4 | 2332323332201012001330 |
5 | 3204434003123212200 |
6 | 43523430014214540 |
7 | 2522653044404115 |
oct | 276737641060174 |
9 | 51410760817516 |
10 | 13121100210300 |
11 | 41a969a003125 |
12 | 157ab59ab4450 |
13 | 742411a980a4 |
14 | 3350c952320c |
15 | 17b49b0159a0 |
hex | beefe84607c |
13121100210300 has 72 divisors (see below), whose sum is σ = 38771455301376. Its totient is φ = 3424514093760.
The previous prime is 13121100210289. The next prime is 13121100210461. The reversal of 13121100210300 is 301200112131.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 13121100210300.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 465273142 + ... + 465301341.
Almost surely, 213121100210300 is an apocalyptic number.
13121100210300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13121100210300 is an abundant number, since it is smaller than the sum of its proper divisors (25650355091076).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13121100210300 is a wasteful number, since it uses less digits than its factorization.
13121100210300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 930574547 (or 930574540 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 13121100210300 its reverse (301200112131), we get a palindrome (13422300322431).
The spelling of 13121100210300 in words is "thirteen trillion, one hundred twenty-one billion, one hundred million, two hundred ten thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •