Base | Representation |
---|---|
bin | 1011110100110100111110… |
… | …0101000001111000111000 |
3 | 1201000222221202021121110121 |
4 | 2331031033211001320320 |
5 | 3201012001441041440 |
6 | 43353043450023024 |
7 | 2511243443632033 |
oct | 275151745017070 |
9 | 51028852247417 |
10 | 13002201112120 |
11 | 4163225619920 |
12 | 155bab6a17a74 |
13 | 7341439b901c |
14 | 32d44a4b201a |
15 | 17833ca2334a |
hex | bd34f941e38 |
13002201112120 has 32 divisors (see below), whose sum is σ = 31914493639920. Its totient is φ = 4728073131520.
The previous prime is 13002201112081. The next prime is 13002201112133. The reversal of 13002201112120 is 2121110220031.
It is a junction number, because it is equal to n+sod(n) for n = 13002201112094 and 13002201112103.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14775228097 + ... + 14775228976.
Almost surely, 213002201112120 is an apocalyptic number.
13002201112120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13002201112120 is an abundant number, since it is smaller than the sum of its proper divisors (18912292527800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13002201112120 is a wasteful number, since it uses less digits than its factorization.
13002201112120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29550457095 (or 29550457091 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 13002201112120 its reverse (2121110220031), we get a palindrome (15123311332151).
The spelling of 13002201112120 in words is "thirteen trillion, two billion, two hundred one million, one hundred twelve thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.411 sec. • engine limits •