Base | Representation |
---|---|
bin | 110000111101100011… |
… | …0010111110111100100 |
3 | 101001101200220011122020 |
4 | 1201323012113313210 |
5 | 3210313441431200 |
6 | 120145215103140 |
7 | 10411402235043 |
oct | 1417306276744 |
9 | 331350804566 |
10 | 105144483300 |
11 | 4065635759a |
12 | 18464811ab0 |
13 | 9bb85881bc |
14 | 51363b255a |
15 | 2b05bd0ea0 |
hex | 187b197de4 |
105144483300 has 72 divisors (see below), whose sum is σ = 304637126976. Its totient is φ = 27999903360.
The previous prime is 105144483281. The next prime is 105144483347. The reversal of 105144483300 is 3384441501.
It is a super-2 number, since 2×1051444833002 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 22947 + ... + 459146.
It is an arithmetic number, because the mean of its divisors is an integer number (4231071208).
Almost surely, 2105144483300 is an apocalyptic number.
105144483300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 105144483300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (152318563488).
105144483300 is an abundant number, since it is smaller than the sum of its proper divisors (199492643676).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105144483300 is a wasteful number, since it uses less digits than its factorization.
105144483300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 482837 (or 482830 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 33.
The spelling of 105144483300 in words is "one hundred five billion, one hundred forty-four million, four hundred eighty-three thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •