Base | Representation |
---|---|
bin | 101111001011100100… |
… | …1100011010011011000 |
3 | 100200112011122221112120 |
4 | 1132113021203103120 |
5 | 3130000422030240 |
6 | 114313521341240 |
7 | 10214543510361 |
oct | 1362711432330 |
9 | 320464587476 |
10 | 101320111320 |
11 | 39a7361a29a |
12 | 17777a97820 |
13 | 97291696bc |
14 | 4c924d8b68 |
15 | 298009dad0 |
hex | 17972634d8 |
101320111320 has 32 divisors (see below), whose sum is σ = 303960334320. Its totient is φ = 27018696320.
The previous prime is 101320111261. The next prime is 101320111349. The reversal of 101320111320 is 23111023101.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 101320111320.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 422167011 + ... + 422167250.
Almost surely, 2101320111320 is an apocalyptic number.
101320111320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101320111320 is an abundant number, since it is smaller than the sum of its proper divisors (202640223000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101320111320 is a wasteful number, since it uses less digits than its factorization.
101320111320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 844334275 (or 844334271 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 101320111320 its reverse (23111023101), we get a palindrome (124431134421).
The spelling of 101320111320 in words is "one hundred one billion, three hundred twenty million, one hundred eleven thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •