Base | Representation |
---|---|
bin | 110001010111000100… |
… | …1101110100001100111 |
3 | 101010121101120202102101 |
4 | 1202232021232201213 |
5 | 3214042224004201 |
6 | 120410213152531 |
7 | 10441542431635 |
oct | 1425611564147 |
9 | 333541522371 |
10 | 106001000551 |
11 | 40a5588a696 |
12 | 1866362b747 |
13 | 9cc3b68a44 |
14 | 51b8050355 |
15 | 2b55ebdd01 |
hex | 18ae26e867 |
106001000551 has 8 divisors (see below), whose sum is σ = 111582990000. Its totient is φ = 100419310080.
The previous prime is 106001000491. The next prime is 106001000563. The reversal of 106001000551 is 155000100601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 106001000551 - 225 = 105967446119 is a prime.
It is a super-2 number, since 2×1060010005512 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106001070551) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1333575 + ... + 1410823.
It is an arithmetic number, because the mean of its divisors is an integer number (13947873750).
Almost surely, 2106001000551 is an apocalyptic number.
106001000551 is a deficient number, since it is larger than the sum of its proper divisors (5581989449).
106001000551 is an equidigital number, since it uses as much as digits as its factorization.
106001000551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149489.
The product of its (nonzero) digits is 150, while the sum is 19.
The spelling of 106001000551 in words is "one hundred six billion, one million, five hundred fifty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •