Base | Representation |
---|---|
bin | 11101001000100001000… |
… | …11000010100101011011 |
3 | 10112200202202111202202012 |
4 | 32210100203002211123 |
5 | 112400024240013201 |
6 | 2043504431100135 |
7 | 132214560056156 |
oct | 16442043024533 |
9 | 3480682452665 |
10 | 1001005001051 |
11 | 356584255080 |
12 | 14200267164b |
13 | 73518567113 |
14 | 3663dad6c9d |
15 | 1b089ad45bb |
hex | e9108c295b |
1001005001051 has 4 divisors (see below), whose sum is σ = 1092005455704. Its totient is φ = 910004546400.
The previous prime is 1001005001027. The next prime is 1001005001071. The reversal of 1001005001051 is 1501005001001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1001005001051 - 218 = 1001004738907 is a prime.
It is a super-2 number, since 2×10010050010512 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1001005001021) 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 3 ways as a sum of consecutive naturals, for example, 45500227310 + ... + 45500227331.
It is an arithmetic number, because the mean of its divisors is an integer number (273001363926).
Almost surely, 21001005001051 is an apocalyptic number.
1001005001051 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1001005001051 is a deficient number, since it is larger than the sum of its proper divisors (91000454653).
1001005001051 is an equidigital number, since it uses as much as digits as its factorization.
1001005001051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91000454652.
The product of its (nonzero) digits is 25, while the sum is 14.
The spelling of 1001005001051 in words is "one trillion, one billion, five million, one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •