Base | Representation |
---|---|
bin | 110001001100100111… |
… | …0110110011111010000 |
3 | 101002200221011012211211 |
4 | 1202121032312133100 |
5 | 3212332401203402 |
6 | 120311314345504 |
7 | 10430051241610 |
oct | 1423116663720 |
9 | 332627135754 |
10 | 105650022352 |
11 | 40895757566 |
12 | 18585b8b294 |
13 | 9c6922c534 |
14 | 51835aaa40 |
15 | 2b352904d7 |
hex | 18993b67d0 |
105650022352 has 80 divisors (see below), whose sum is σ = 244473495552. Its totient is φ = 43284528000.
The previous prime is 105650022301. The next prime is 105650022391. The reversal of 105650022352 is 253220056501.
It is a happy number.
It is a super-2 number, since 2×1056500223522 (a number of 23 digits) contains 22 as substring.
It is a congruent 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 15 ways as a sum of consecutive naturals, for example, 7024 + ... + 459727.
Almost surely, 2105650022352 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 105650022352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (122236747776).
105650022352 is an abundant number, since it is smaller than the sum of its proper divisors (138823473200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105650022352 is a wasteful number, since it uses less digits than its factorization.
105650022352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 466856 (or 466850 counting only the distinct ones).
The product of its (nonzero) digits is 18000, while the sum is 31.
Adding to 105650022352 its reverse (253220056501), we get a palindrome (358870078853).
The spelling of 105650022352 in words is "one hundred five billion, six hundred fifty million, twenty-two thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •