Base | Representation |
---|---|
bin | 1011110100110101000000… |
… | …1110101110010110001000 |
3 | 1201000222222111211220121102 |
4 | 2331031100032232112020 |
5 | 3201012012240321440 |
6 | 43353044520200532 |
7 | 2511243635553650 |
oct | 275152016562610 |
9 | 51028874756542 |
10 | 13002212042120 |
11 | 4163230804784 |
12 | 155baba609148 |
13 | 734146044c92 |
14 | 32d44bb19360 |
15 | 17833d981b15 |
hex | bd3503ae588 |
13002212042120 has 64 divisors (see below), whose sum is σ = 33437867886720. Its totient is φ = 4457420158464.
The previous prime is 13002212042119. The next prime is 13002212042159. The reversal of 13002212042120 is 2124021220031.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 13002212042092 and 13002212042101.
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, 98084 + ... + 5100396.
It is an arithmetic number, because the mean of its divisors is an integer number (522466685730).
Almost surely, 213002212042120 is an apocalyptic number.
13002212042120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13002212042120 is an abundant number, since it is smaller than the sum of its proper divisors (20435655844600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13002212042120 is a wasteful number, since it uses less digits than its factorization.
13002212042120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5011614 (or 5011610 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 13002212042120 its reverse (2124021220031), we get a palindrome (15126233262151).
The spelling of 13002212042120 in words is "thirteen trillion, two billion, two hundred twelve million, forty-two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •