Base | Representation |
---|---|
bin | 110001001110000100… |
… | …1011010010100110010 |
3 | 101002211100011212200020 |
4 | 1202130021122110302 |
5 | 3212432411143142 |
6 | 120320222504310 |
7 | 10431214030500 |
oct | 1423411322462 |
9 | 332740155606 |
10 | 105698927922 |
11 | 4091031aa95 |
12 | 1859a435096 |
13 | 9c763c3743 |
14 | 5189c9b670 |
15 | 2b39700cec |
hex | 189c25a532 |
105698927922 has 96 divisors (see below), whose sum is σ = 256101912000. Its totient is φ = 28962283392.
The previous prime is 105698927891. The next prime is 105698927963. The reversal of 105698927922 is 229729896501.
It is a super-2 number, since 2×1056989279222 (a number of 23 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (60) coincides with the sum of the digits of its prime factors.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1228773 + ... + 1311975.
It is an arithmetic number, because the mean of its divisors is an integer number (2667728250).
Almost surely, 2105698927922 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 105698927922, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (128050956000).
105698927922 is an abundant number, since it is smaller than the sum of its proper divisors (150402984078).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105698927922 is a wasteful number, since it uses less digits than its factorization.
105698927922 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 83400 (or 83393 counting only the distinct ones).
The product of its (nonzero) digits is 9797760, while the sum is 60.
The spelling of 105698927922 in words is "one hundred five billion, six hundred ninety-eight million, nine hundred twenty-seven thousand, nine hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •