Base | Representation |
---|---|
bin | 101110100110001000… |
… | …0001010011101000111 |
3 | 100120021121020012001112 |
4 | 1131030100022131013 |
5 | 3114412232201401 |
6 | 113545113115235 |
7 | 10141445112146 |
oct | 1351420123507 |
9 | 316247205045 |
10 | 100063553351 |
11 | 394892a3733 |
12 | 174870b8b1b |
13 | 9588a31b88 |
14 | 4bb368575d |
15 | 2909ae03bb |
hex | 174c40a747 |
100063553351 has 8 divisors (see below), whose sum is σ = 101577898704. Its totient is φ = 98559475200.
The previous prime is 100063553299. The next prime is 100063553377. The reversal of 100063553351 is 153355360001.
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 100063553351 - 26 = 100063553287 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100063555351) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 2547161 + ... + 2586146.
It is an arithmetic number, because the mean of its divisors is an integer number (12697237338).
Almost surely, 2100063553351 is an apocalyptic number.
100063553351 is a deficient number, since it is larger than the sum of its proper divisors (1514345353).
100063553351 is a wasteful number, since it uses less digits than its factorization.
100063553351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5133601.
The product of its (nonzero) digits is 20250, while the sum is 32.
The spelling of 100063553351 in words is "one hundred billion, sixty-three million, five hundred fifty-three thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •