Base | Representation |
---|---|
bin | 1001000110010111100100… |
… | …0111001011000111010011 |
3 | 1022102110200101212000220211 |
4 | 2101211321013023013103 |
5 | 2302410230223143201 |
6 | 33140123302544551 |
7 | 2051560331150443 |
oct | 221457107130723 |
9 | 38373611760824 |
10 | 10005010756051 |
11 | 3208112818223 |
12 | 1157055a38157 |
13 | 5776122b1b2c |
14 | 2683607d0123 |
15 | 1253becc1651 |
hex | 919791cb1d3 |
10005010756051 has 4 divisors (see below), whose sum is σ = 10005199415632. Its totient is φ = 10004822096472.
The previous prime is 10005010756009. The next prime is 10005010756057. The reversal of 10005010756051 is 15065701050001.
10005010756051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 10005010756051 - 229 = 10004473885139 is a prime.
It is a super-3 number, since 3×100050107560513 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10005010756057) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 94250220 + ... + 94356313.
It is an arithmetic number, because the mean of its divisors is an integer number (2501299853908).
Almost surely, 210005010756051 is an apocalyptic number.
10005010756051 is a deficient number, since it is larger than the sum of its proper divisors (188659581).
10005010756051 is an equidigital number, since it uses as much as digits as its factorization.
10005010756051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 188659580.
The product of its (nonzero) digits is 5250, while the sum is 31.
The spelling of 10005010756051 in words is "ten trillion, five billion, ten million, seven hundred fifty-six thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •