Base | Representation |
---|---|
bin | 1001001001100110010100… |
… | …1000000001110010110111 |
3 | 1022121202221020111021112021 |
4 | 2102121211020001302313 |
5 | 2304312411030314201 |
6 | 33221422352334011 |
7 | 2055563550061240 |
oct | 222314510016267 |
9 | 38552836437467 |
10 | 10060510010551 |
11 | 3229702695600 |
12 | 1165964544307 |
13 | 57c9184640b0 |
14 | 26ad07621cc7 |
15 | 126a6c339ea1 |
hex | 92665201cb7 |
10060510010551 has 48 divisors (see below), whose sum is σ = 14410746891072. Its totient is φ = 6810664227840.
The previous prime is 10060510010531. The next prime is 10060510010591. The reversal of 10060510010551 is 15501001506001.
It is not a de Polignac number, because 10060510010551 - 215 = 10060509977783 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10060510010531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 26685700 + ... + 27060073.
It is an arithmetic number, because the mean of its divisors is an integer number (300223893564).
Almost surely, 210060510010551 is an apocalyptic number.
10060510010551 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10060510010551 is a deficient number, since it is larger than the sum of its proper divisors (4350236880521).
10060510010551 is a wasteful number, since it uses less digits than its factorization.
10060510010551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53745832 (or 53745821 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 25.
Adding to 10060510010551 its reverse (15501001506001), we get a palindrome (25561511516552).
The spelling of 10060510010551 in words is "ten trillion, sixty billion, five hundred ten million, ten thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •