Base | Representation |
---|---|
bin | 1001100011001111010011… |
… | …1110001000110010011011 |
3 | 1101011212221102221100001020 |
4 | 2120303310332020302123 |
5 | 2334022032030013201 |
6 | 34200033012053523 |
7 | 2132446550160303 |
oct | 230636476106233 |
9 | 41155842840036 |
10 | 10501010001051 |
11 | 33894a9426229 |
12 | 12171bb0042a3 |
13 | 5b231960564b |
14 | 284374544603 |
15 | 13324e580a36 |
hex | 98cf4f88c9b |
10501010001051 has 16 divisors (see below), whose sum is σ = 14214815524224. Its totient is φ = 6894004987584.
The previous prime is 10501010001049. The next prime is 10501010001121. The reversal of 10501010001051 is 15010001010501.
It is not a de Polignac number, because 10501010001051 - 21 = 10501010001049 is a prime.
It is a super-2 number, since 2×105010100010512 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10501010001051.
It is not an unprimeable number, because it can be changed into a prime (10501010001011) 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 15 ways as a sum of consecutive naturals, for example, 7622826 + ... + 8894351.
It is an arithmetic number, because the mean of its divisors is an integer number (888425970264).
Almost surely, 210501010001051 is an apocalyptic number.
10501010001051 is a deficient number, since it is larger than the sum of its proper divisors (3713805523173).
10501010001051 is a wasteful number, since it uses less digits than its factorization.
10501010001051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16520410.
The product of its (nonzero) digits is 25, while the sum is 15.
Adding to 10501010001051 its reverse (15010001010501), we get a palindrome (25511011011552).
The spelling of 10501010001051 in words is "ten trillion, five hundred one billion, ten million, one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •