Base | Representation |
---|---|
bin | 110001001000010100… |
… | …1101001001111000010 |
3 | 101002022220020201021220 |
4 | 1202100221221033002 |
5 | 3212034022113020 |
6 | 120245132455510 |
7 | 10423352431233 |
oct | 1422051511702 |
9 | 332286221256 |
10 | 105506051010 |
11 | 40821462788 |
12 | 1854591a596 |
13 | 9c454616a9 |
14 | 516c41108a |
15 | 2b27802240 |
hex | 1890a693c2 |
105506051010 has 64 divisors (see below), whose sum is σ = 265534519680. Its totient is φ = 26792640000.
The previous prime is 105506051009. The next prime is 105506051011. The reversal of 105506051010 is 10150605501.
It is an interprime number because it is at equal distance from previous prime (105506051009) and next prime (105506051011).
It is a super-3 number, since 3×1055060510103 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (105506051011) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 767116 + ... + 894135.
It is an arithmetic number, because the mean of its divisors is an integer number (4148976870).
Almost surely, 2105506051010 is an apocalyptic number.
105506051010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
105506051010 is an abundant number, since it is smaller than the sum of its proper divisors (160028468670).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105506051010 is a wasteful number, since it uses less digits than its factorization.
105506051010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1661363.
The product of its (nonzero) digits is 750, while the sum is 24.
Adding to 105506051010 its reverse (10150605501), we get a palindrome (115656656511).
The spelling of 105506051010 in words is "one hundred five billion, five hundred six million, fifty-one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •