Base | Representation |
---|---|
bin | 101111000101011010… |
… | …0101000110011001110 |
3 | 100122222202111221210100 |
4 | 1132022310220303032 |
5 | 3124040001132342 |
6 | 114241212551530 |
7 | 10206452613402 |
oct | 1361264506316 |
9 | 318882457710 |
10 | 101113302222 |
11 | 39977906589 |
12 | 1771a7825a6 |
13 | 96c536a05a |
14 | 4c72c63102 |
15 | 296bd4be4c |
hex | 178ad28cce |
101113302222 has 48 divisors (see below), whose sum is σ = 222561743040. Its totient is φ = 33171330816.
The previous prime is 101113302211. The next prime is 101113302271. The reversal of 101113302222 is 222203311101.
101113302222 is a `hidden beast` number, since 1 + 0 + 111 + 330 + 2 + 222 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 101113302195 and 101113302204.
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 23 ways as a sum of consecutive naturals, for example, 331498 + ... + 558674.
It is an arithmetic number, because the mean of its divisors is an integer number (4636702980).
Almost surely, 2101113302222 is an apocalyptic number.
101113302222 is an abundant number, since it is smaller than the sum of its proper divisors (121448440818).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101113302222 is a wasteful number, since it uses less digits than its factorization.
101113302222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 227577 (or 227574 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 101113302222 its reverse (222203311101), we get a palindrome (323316613323).
The spelling of 101113302222 in words is "one hundred one billion, one hundred thirteen million, three hundred two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •