Base | Representation |
---|---|
bin | 110000111111111000… |
… | …1100011111000101100 |
3 | 101001121011110211202102 |
4 | 1201333301203320230 |
5 | 3210444031213310 |
6 | 120201100114232 |
7 | 10413344002541 |
oct | 1417761437054 |
9 | 331534424672 |
10 | 105222913580 |
11 | 40696656404 |
12 | 18486b35978 |
13 | 9bcb8b8c55 |
14 | 514298abc8 |
15 | 2b0ca248a5 |
hex | 187fc63e2c |
105222913580 has 12 divisors (see below), whose sum is σ = 220968118560. Its totient is φ = 42089165424.
The previous prime is 105222913571. The next prime is 105222913589. The reversal of 105222913580 is 85319222501.
It is an interprime number because it is at equal distance from previous prime (105222913571) and next prime (105222913589).
It is a super-2 number, since 2×1052229135802 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (105222913589) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2630572820 + ... + 2630572859.
It is an arithmetic number, because the mean of its divisors is an integer number (18414009880).
Almost surely, 2105222913580 is an apocalyptic number.
105222913580 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
105222913580 is an abundant number, since it is smaller than the sum of its proper divisors (115745204980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105222913580 is a wasteful number, since it uses less digits than its factorization.
105222913580 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5261145688 (or 5261145686 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 38.
The spelling of 105222913580 in words is "one hundred five billion, two hundred twenty-two million, nine hundred thirteen thousand, five hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •