Base | Representation |
---|---|
bin | 10111000000101001111100… |
… | …100110111100011001110100 |
3 | 111021022122011200000211101102 |
4 | 113000221330212330121310 |
5 | 101231030311130341040 |
6 | 555122404433145232 |
7 | 30213316032010115 |
oct | 2700517446743164 |
9 | 437278150024342 |
10 | 101200110012020 |
11 | 2a2777a8902998 |
12 | b4253140bb218 |
13 | 446118b46b606 |
14 | 1adc17bbb620c |
15 | ba76a8e8b515 |
hex | 5c0a7c9bc674 |
101200110012020 has 24 divisors (see below), whose sum is σ = 223705506343200. Its totient is φ = 38349515372832.
The previous prime is 101200110012019. The next prime is 101200110012101. The reversal of 101200110012020 is 20210011002101.
It is a junction number, because it is equal to n+sod(n) for n = 101200110011992 and 101200110012010.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 133158039110 + ... + 133158039869.
It is an arithmetic number, because the mean of its divisors is an integer number (9321062764300).
Almost surely, 2101200110012020 is an apocalyptic number.
101200110012020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101200110012020 is an abundant number, since it is smaller than the sum of its proper divisors (122505396331180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101200110012020 is a wasteful number, since it uses less digits than its factorization.
101200110012020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 266316079007 (or 266316079005 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 101200110012020 its reverse (20210011002101), we get a palindrome (121410121014121).
The spelling of 101200110012020 in words is "one hundred one trillion, two hundred billion, one hundred ten million, twelve thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •