Base | Representation |
---|---|
bin | 11000001110010001111101… |
… | …010001100101010110100110 |
3 | 111222012121002102112020220012 |
4 | 120032101331101211112212 |
5 | 102430430043431241210 |
6 | 1014325132105010222 |
7 | 31303601331433646 |
oct | 3016217521452646 |
9 | 458177072466805 |
10 | 106534470571430 |
11 | 30a44019320590 |
12 | bb47116783972 |
13 | 475a207c5a525 |
14 | 1c4441dcb8526 |
15 | c4b3156dd305 |
hex | 60e47d4655a6 |
106534470571430 has 192 divisors, whose sum is σ = 215469812710656. Its totient is φ = 37605256416000.
The previous prime is 106534470571429. The next prime is 106534470571453. The reversal of 106534470571430 is 34175074435601.
It is a super-2 number, since 2×1065344705714302 (a number of 29 digits) contains 22 as substring.
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 95 ways as a sum of consecutive naturals, for example, 12022845200 + ... + 12022854060.
It is an arithmetic number, because the mean of its divisors is an integer number (1122238607868).
Almost surely, 2106534470571430 is an apocalyptic number.
106534470571430 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
106534470571430 is an abundant number, since it is smaller than the sum of its proper divisors (108935342139226).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106534470571430 is a wasteful number, since it uses less digits than its factorization.
106534470571430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9331 (or 9252 counting only the distinct ones).
The product of its (nonzero) digits is 4233600, while the sum is 50.
The spelling of 106534470571430 in words is "one hundred six trillion, five hundred thirty-four billion, four hundred seventy million, five hundred seventy-one thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •