Base | Representation |
---|---|
bin | 11000000111001111101100… |
… | …110010000100111101000011 |
3 | 111220111101012020021102011101 |
4 | 120013033230302010331003 |
5 | 102400014432033243003 |
6 | 1013315054512155231 |
7 | 31223634615032035 |
oct | 3007175462047503 |
9 | 456441166242141 |
10 | 106051010056003 |
11 | 30877a87483701 |
12 | ba89490838b17 |
13 | 472374b593b1c |
14 | 1c28c79539c55 |
15 | c3d96bb1811d |
hex | 6073ecc84f43 |
106051010056003 has 8 divisors (see below), whose sum is σ = 107543772661248. Its totient is φ = 104559328776384.
The previous prime is 106051010056001. The next prime is 106051010056027. The reversal of 106051010056003 is 300650010150601.
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 106051010056003 - 21 = 106051010056001 is a prime.
It is a super-2 number, since 2×1060510100560032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (106051010056001) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 270133876 + ... + 270526177.
It is an arithmetic number, because the mean of its divisors is an integer number (13442971582656).
Almost surely, 2106051010056003 is an apocalyptic number.
106051010056003 is a deficient number, since it is larger than the sum of its proper divisors (1492762605245).
106051010056003 is an equidigital number, since it uses as much as digits as its factorization.
106051010056003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 540662813.
The product of its (nonzero) digits is 2700, while the sum is 28.
The spelling of 106051010056003 in words is "one hundred six trillion, fifty-one billion, ten million, fifty-six thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •