Base | Representation |
---|---|
bin | 10111000000101001111100… |
… | …100111101100111100100100 |
3 | 111021022122011200101221010120 |
4 | 113000221330213230330210 |
5 | 101231030311203221402 |
6 | 555122404441321540 |
7 | 30213316033465602 |
oct | 2700517447547444 |
9 | 437278150357116 |
10 | 101200110210852 |
11 | 2a2777a8a29314 |
12 | b4253141962b0 |
13 | 446118b50ac73 |
14 | 1adc17bc28872 |
15 | ba76a8eca3bc |
hex | 5c0a7c9ecf24 |
101200110210852 has 24 divisors (see below), whose sum is σ = 244276128096000. Its totient is φ = 32570150412576.
The previous prime is 101200110210847. The next prime is 101200110210853. The reversal of 101200110210852 is 258012011002101.
It is not an unprimeable number, because it can be changed into a prime (101200110210853) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 145402456852 + ... + 145402457547.
It is an arithmetic number, because the mean of its divisors is an integer number (10178172004000).
Almost surely, 2101200110210852 is an apocalyptic number.
101200110210852 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101200110210852 is an abundant number, since it is smaller than the sum of its proper divisors (143076017885148).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101200110210852 is a wasteful number, since it uses less digits than its factorization.
101200110210852 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 290804914435 (or 290804914433 counting only the distinct ones).
The product of its (nonzero) digits is 320, while the sum is 24.
Adding to 101200110210852 its reverse (258012011002101), we get a palindrome (359212121212953).
The spelling of 101200110210852 in words is "one hundred one trillion, two hundred billion, one hundred ten million, two hundred ten thousand, eight hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •