Base | Representation |
---|---|
bin | 101111111111010100… |
… | …1111011101101000000 |
3 | 100212000012021102001112 |
4 | 1133332221323231000 |
5 | 3142030000344440 |
6 | 115202113422452 |
7 | 10305561045431 |
oct | 1377651735500 |
9 | 325005242045 |
10 | 103056653120 |
11 | 3a784880903 |
12 | 17b8156aa28 |
13 | 9944b6b725 |
14 | 4db8db3488 |
15 | 2a3276e965 |
hex | 17fea7bb40 |
103056653120 has 56 divisors (see below), whose sum is σ = 245482713504. Its totient is φ = 41209381376.
The previous prime is 103056653111. The next prime is 103056653149. The reversal of 103056653120 is 21356650301.
It is a hoax number, since the sum of its digits (32) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 974687 + ... + 1075233.
It is an arithmetic number, because the mean of its divisors is an integer number (4383619884).
Almost surely, 2103056653120 is an apocalyptic number.
103056653120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103056653120 is an abundant number, since it is smaller than the sum of its proper divisors (142426060384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103056653120 is a wasteful number, since it uses less digits than its factorization.
103056653120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103767 (or 103757 counting only the distinct ones).
The product of its (nonzero) digits is 16200, while the sum is 32.
The spelling of 103056653120 in words is "one hundred three billion, fifty-six million, six hundred fifty-three thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •