Base | Representation |
---|---|
bin | 110001100100010101… |
… | …1100010001011000110 |
3 | 101011202102001122120110 |
4 | 1203020223202023012 |
5 | 3221000143223340 |
6 | 120522312413450 |
7 | 10455555445605 |
oct | 1431053421306 |
9 | 334672048513 |
10 | 106446070470 |
11 | 41164039273 |
12 | 187686a7286 |
13 | a06512a71c |
14 | 521b1c7a3c |
15 | 2b800d6680 |
hex | 18c8ae22c6 |
106446070470 has 64 divisors (see below), whose sum is σ = 261659206656. Its totient is φ = 27701479680.
The previous prime is 106446070433. The next prime is 106446070513. The reversal of 106446070470 is 74070644601.
It is a happy number.
It is a super-2 number, since 2×1064460704702 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 380490 + ... + 598050.
It is an arithmetic number, because the mean of its divisors is an integer number (4088425104).
Almost surely, 2106446070470 is an apocalyptic number.
106446070470 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 106446070470, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (130829603328).
106446070470 is an abundant number, since it is smaller than the sum of its proper divisors (155213136186).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106446070470 is a wasteful number, since it uses less digits than its factorization.
106446070470 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 217965.
The product of its (nonzero) digits is 112896, while the sum is 39.
The spelling of 106446070470 in words is "one hundred six billion, four hundred forty-six million, seventy thousand, four hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •