Base | Representation |
---|---|
bin | 10111000000101001111100… |
… | …100110111100011001101101 |
3 | 111021022122011200000211101011 |
4 | 113000221330212330121231 |
5 | 101231030311130341023 |
6 | 555122404433145221 |
7 | 30213316032010105 |
oct | 2700517446743155 |
9 | 437278150024334 |
10 | 101200110012013 |
11 | 2a2777a8902991 |
12 | b4253140bb211 |
13 | 446118b46b5cc |
14 | 1adc17bbb6205 |
15 | ba76a8e8b50d |
hex | 5c0a7c9bc66d |
101200110012013 has 32 divisors (see below), whose sum is σ = 106780426917120. Its totient is φ = 95721763737600.
The previous prime is 101200110011983. The next prime is 101200110012019. The reversal of 101200110012013 is 310210011002101.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 101200110012013 - 225 = 101200076457581 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101200110011984 and 101200110012002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101200110012019) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8825328706 + ... + 8825340172.
It is an arithmetic number, because the mean of its divisors is an integer number (3336888341160).
Almost surely, 2101200110012013 is an apocalyptic number.
It is an amenable number.
101200110012013 is a deficient number, since it is larger than the sum of its proper divisors (5580316905107).
101200110012013 is a wasteful number, since it uses less digits than its factorization.
101200110012013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18277.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 101200110012013 its reverse (310210011002101), we get a palindrome (411410121014114).
The spelling of 101200110012013 in words is "one hundred one trillion, two hundred billion, one hundred ten million, twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •