Base | Representation |
---|---|
bin | 1100000010111… |
… | …11011101100110 |
3 | 21001011002110020 |
4 | 12001133131212 |
5 | 201332214220 |
6 | 14005540010 |
7 | 2334642660 |
oct | 601373546 |
9 | 231132406 |
10 | 101054310 |
11 | 52051665 |
12 | 29a14606 |
13 | 17c22666 |
14 | d5c7530 |
15 | 8d12040 |
hex | 605f766 |
101054310 has 32 divisors (see below), whose sum is σ = 277178112. Its totient is φ = 23098080.
The previous prime is 101054297. The next prime is 101054311. The reversal of 101054310 is 13450101.
It is a super-3 number, since 3×1010543103 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
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 101054310.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101054311) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 240396 + ... + 240815.
It is an arithmetic number, because the mean of its divisors is an integer number (8661816).
Almost surely, 2101054310 is an apocalyptic number.
101054310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101054310 is an abundant number, since it is smaller than the sum of its proper divisors (176123802).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101054310 is a wasteful number, since it uses less digits than its factorization.
101054310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 481228.
The product of its (nonzero) digits is 60, while the sum is 15.
The square root of 101054310 is about 10052.5772814736. The cubic root of 101054310 is about 465.7844084919.
The spelling of 101054310 in words is "one hundred one million, fifty-four thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •