Base | Representation |
---|---|
bin | 101111001101111101… |
… | …1000100011101000110 |
3 | 100200201202100220222010 |
4 | 1132123323010131012 |
5 | 3130131422413110 |
6 | 114325502115050 |
7 | 10216535326152 |
oct | 1363373043506 |
9 | 320652326863 |
10 | 101400201030 |
11 | 3a004851937 |
12 | 1779a87ba86 |
13 | 973c92b86b |
14 | 4c9cdc6062 |
15 | 298711e020 |
hex | 179bec4746 |
101400201030 has 64 divisors (see below), whose sum is σ = 250411772160. Its totient is φ = 26263606656.
The previous prime is 101400201017. The next prime is 101400201047. The reversal of 101400201030 is 30102004101.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 101400200997 and 101400201015.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11344 + ... + 450476.
It is an arithmetic number, because the mean of its divisors is an integer number (3912683940).
Almost surely, 2101400201030 is an apocalyptic number.
101400201030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 101400201030, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (125205886080).
101400201030 is an abundant number, since it is smaller than the sum of its proper divisors (149011571130).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101400201030 is a wasteful number, since it uses less digits than its factorization.
101400201030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 439365.
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 101400201030 its reverse (30102004101), we get a palindrome (131502205131).
The spelling of 101400201030 in words is "one hundred one billion, four hundred million, two hundred one thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •