Base | Representation |
---|---|
bin | 110001010111111110… |
… | …1100000101010001000 |
3 | 101010200111200210102000 |
4 | 1202233331200222020 |
5 | 3214123011234311 |
6 | 120413215511000 |
7 | 10442361424311 |
oct | 1425775405210 |
9 | 333614623360 |
10 | 106031352456 |
11 | 40a70a30507 |
12 | 18671828460 |
13 | 9cca234c53 |
14 | 51bc0b1608 |
15 | 2b589b7056 |
hex | 18aff60a88 |
106031352456 has 64 divisors (see below), whose sum is σ = 295023600000. Its totient is φ = 35284736448.
The previous prime is 106031352451. The next prime is 106031352487. The reversal of 106031352456 is 654253130601.
106031352456 is a `hidden beast` number, since 1 + 0 + 603 + 1 + 3 + 5 + 2 + 45 + 6 = 666.
It is a super-2 number, since 2×1060313524562 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 106031352456.
It is not an unprimeable number, because it can be changed into a prime (106031352451) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 280371 + ... + 539138.
It is an arithmetic number, because the mean of its divisors is an integer number (4609743750).
Almost surely, 2106031352456 is an apocalyptic number.
It is an amenable number.
106031352456 is an abundant number, since it is smaller than the sum of its proper divisors (188992247544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106031352456 is a wasteful number, since it uses less digits than its factorization.
106031352456 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 820123 (or 820113 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 36.
The spelling of 106031352456 in words is "one hundred six billion, thirty-one million, three hundred fifty-two thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •