Base | Representation |
---|---|
bin | 1001000110011001011001… |
… | …0101010101000011100010 |
3 | 1022102111221120100022111012 |
4 | 2101212112111111003202 |
5 | 2302412231224143200 |
6 | 33140244054420522 |
7 | 2051605433205644 |
oct | 221462625250342 |
9 | 38374846308435 |
10 | 10005501006050 |
11 | 3208344525310 |
12 | 1157172061742 |
13 | 57768ca320a4 |
14 | 2683a9968894 |
15 | 1253ecd60a35 |
hex | 919965550e2 |
10005501006050 has 96 divisors (see below), whose sum is σ = 20697987547584. Its totient is φ = 3567496608000.
The previous prime is 10005501006013. The next prime is 10005501006113. The reversal of 10005501006050 is 5060010550001.
It is a super-2 number, since 2×100055010060502 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
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, 47146277 + ... + 47358023.
It is an arithmetic number, because the mean of its divisors is an integer number (215604036954).
Almost surely, 210005501006050 is an apocalyptic number.
10005501006050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10005501006050 is an abundant number, since it is smaller than the sum of its proper divisors (10692486541534).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10005501006050 is a wasteful number, since it uses less digits than its factorization.
10005501006050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 213444 (or 213439 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 23.
Adding to 10005501006050 its reverse (5060010550001), we get a palindrome (15065511556051).
The spelling of 10005501006050 in words is "ten trillion, five billion, five hundred one million, six thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •