Base | Representation |
---|---|
bin | 1100000000111111100110… |
… | …0011010100010101001100 |
3 | 1201202222110000200012210101 |
4 | 3000033321203110111030 |
5 | 3212423030033022200 |
6 | 44033051402020444 |
7 | 2532323062350022 |
oct | 300177143242514 |
9 | 51688400605711 |
10 | 13211211220300 |
11 | 4233930355715 |
12 | 1594507aa7724 |
13 | 74aa728b7352 |
14 | 3395d707a712 |
15 | 17d9c1ebe26a |
hex | c03f98d454c |
13211211220300 has 18 divisors (see below), whose sum is σ = 28668328348268. Its totient is φ = 5284484488080.
The previous prime is 13211211220279. The next prime is 13211211220321. The reversal of 13211211220300 is 302211211231.
It is an interprime number because it is at equal distance from previous prime (13211211220279) and next prime (13211211220321).
It is a super-2 number, since 2×132112112203002 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 66056056002 + ... + 66056056201.
Almost surely, 213211211220300 is an apocalyptic number.
13211211220300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13211211220300 is an abundant number, since it is smaller than the sum of its proper divisors (15457117127968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13211211220300 is a wasteful number, since it uses less digits than its factorization.
13211211220300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 132112112217 (or 132112112210 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 13211211220300 its reverse (302211211231), we get a palindrome (13513422431531).
The spelling of 13211211220300 in words is "thirteen trillion, two hundred eleven billion, two hundred eleven million, two hundred twenty thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •