Base | Representation |
---|---|
bin | 101111000010111101… |
… | …0110110000011100110 |
3 | 100122210000201202202200 |
4 | 1132011322312003212 |
5 | 3123402421341202 |
6 | 114225113515330 |
7 | 10204433461440 |
oct | 1360572660346 |
9 | 318700652680 |
10 | 101031043302 |
11 | 39935432202 |
12 | 176b7112b46 |
13 | 96b12c8737 |
14 | 4c65d6d490 |
15 | 29649ede1c |
hex | 1785eb60e6 |
101031043302 has 96 divisors (see below), whose sum is σ = 257508605952. Its totient is φ = 28029177792.
The previous prime is 101031043187. The next prime is 101031043313. The reversal of 101031043302 is 203340130101.
101031043302 is a `hidden beast` number, since 1 + 0 + 10 + 310 + 43 + 302 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 684928 + ... + 819260.
It is an arithmetic number, because the mean of its divisors is an integer number (2682381312).
Almost surely, 2101031043302 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 101031043302, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (128754302976).
101031043302 is an abundant number, since it is smaller than the sum of its proper divisors (156477562650).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101031043302 is a wasteful number, since it uses less digits than its factorization.
101031043302 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 134522 (or 134519 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 101031043302 its reverse (203340130101), we get a palindrome (304371173403).
The spelling of 101031043302 in words is "one hundred one billion, thirty-one million, forty-three thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •