Base | Representation |
---|---|
bin | 110001100011011011… |
… | …1011000000111001000 |
3 | 101011200021202122010201 |
4 | 1203012313120013020 |
5 | 3220414344324202 |
6 | 120515304021544 |
7 | 10455035564413 |
oct | 1430667300710 |
9 | 334607678121 |
10 | 106415620552 |
11 | 4114893084a |
12 | 1875a4618b4 |
13 | a05ba28a17 |
14 | 521713cb7a |
15 | 2b7c5be387 |
hex | 18c6dd81c8 |
106415620552 has 16 divisors (see below), whose sum is σ = 199992240000. Its totient is φ = 53084356560.
The previous prime is 106415620523. The next prime is 106415620567. The reversal of 106415620552 is 255026514601.
It is a super-2 number, since 2×1064156205522 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15428052 + ... + 15434947.
It is an arithmetic number, because the mean of its divisors is an integer number (12499515000).
Almost surely, 2106415620552 is an apocalyptic number.
It is an amenable number.
106415620552 is a deficient number, since it is larger than the sum of its proper divisors (93576619448).
106415620552 is a wasteful number, since it uses less digits than its factorization.
106415620552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30863436 (or 30863432 counting only the distinct ones).
The product of its (nonzero) digits is 72000, while the sum is 37.
The spelling of 106415620552 in words is "one hundred six billion, four hundred fifteen million, six hundred twenty thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •