Base | Representation |
---|---|
bin | 110001011000011001… |
… | …1101001000000000000 |
3 | 101010201111101201100111 |
4 | 1202300303221000000 |
5 | 3214140124324100 |
6 | 120414444001104 |
7 | 10442623144360 |
oct | 1426063510000 |
9 | 333644351314 |
10 | 106045542400 |
11 | 40a78a42636 |
12 | 18676530194 |
13 | a000162975 |
14 | 51bdd269a0 |
15 | 2b59d6b6ba |
hex | 18b0ce9000 |
106045542400 has 312 divisors, whose sum is σ = 302105048960. Its totient is φ = 36168007680.
The previous prime is 106045542349. The next prime is 106045542401. The reversal of 106045542400 is 4245540601.
It is a happy number.
It is a super-2 number, since 2×1060455424002 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106045542401) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 241561381 + ... + 241561819.
Almost surely, 2106045542400 is an apocalyptic number.
106045542400 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 106045542400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (151052524480).
106045542400 is an abundant number, since it is smaller than the sum of its proper divisors (196059506560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106045542400 is an equidigital number, since it uses as much as digits as its factorization.
106045542400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 817 (or 790 counting only the distinct ones).
The product of its (nonzero) digits is 19200, while the sum is 31.
The spelling of 106045542400 in words is "one hundred six billion, forty-five million, five hundred forty-two thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •