Base | Representation |
---|---|
bin | 10111111000000111001101… |
… | …010100001111100111001010 |
3 | 111202210222000010010220222110 |
4 | 113320013031110033213022 |
5 | 102231000213103243020 |
6 | 1011201233340003150 |
7 | 31055541644624631 |
oct | 2770071524174712 |
9 | 452728003126873 |
10 | 105011100056010 |
11 | 30506a59391045 |
12 | b93ba30b304b6 |
13 | 4679672a97995 |
14 | 1bd07c8872518 |
15 | c218a67468e0 |
hex | 5f81cd50f9ca |
105011100056010 has 16 divisors (see below), whose sum is σ = 252026640134496. Its totient is φ = 28002960014928.
The previous prime is 105011100055999. The next prime is 105011100056011. The reversal of 105011100056010 is 10650001110501.
It is a happy number.
It is a super-2 number, since 2×1050111000560102 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (105011100056011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1750185000904 + ... + 1750185000963.
It is an arithmetic number, because the mean of its divisors is an integer number (15751665008406).
Almost surely, 2105011100056010 is an apocalyptic number.
105011100056010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
105011100056010 is an abundant number, since it is smaller than the sum of its proper divisors (147015540078486).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105011100056010 is a wasteful number, since it uses less digits than its factorization.
105011100056010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3500370001877.
The product of its (nonzero) digits is 150, while the sum is 21.
Adding to 105011100056010 its reverse (10650001110501), we get a palindrome (115661101166511).
The spelling of 105011100056010 in words is "one hundred five trillion, eleven billion, one hundred million, fifty-six thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •