Base | Representation |
---|---|
bin | 110000111111111011… |
… | …0100011011000100000 |
3 | 101001121020221022220022 |
4 | 1201333312203120200 |
5 | 3210444400102430 |
6 | 120201144133012 |
7 | 10413361063064 |
oct | 1417766433040 |
9 | 331536838808 |
10 | 105224222240 |
11 | 4069736a645 |
12 | 18487467168 |
13 | 9bcbc567c7 |
14 | 5142c0baa4 |
15 | 2b0cbd24e5 |
hex | 187fda3620 |
105224222240 has 72 divisors (see below), whose sum is σ = 262364791500. Its totient is φ = 39874420224.
The previous prime is 105224222237. The next prime is 105224222269. The reversal of 105224222240 is 42222422501.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 105165301264 + 58920976 = 324292^2 + 7676^2 .
It is a super-2 number, since 2×1052242222402 (a number of 23 digits) contains 22 as substring.
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 11 ways as a sum of consecutive naturals, for example, 853115 + ... + 968634.
Almost surely, 2105224222240 is an apocalyptic number.
105224222240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
105224222240 is an abundant number, since it is smaller than the sum of its proper divisors (157140569260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105224222240 is a wasteful number, since it uses less digits than its factorization.
105224222240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1821802 (or 1821775 counting only the distinct ones).
The product of its (nonzero) digits is 5120, while the sum is 26.
Adding to 105224222240 its reverse (42222422501), we get a palindrome (147446644741).
The spelling of 105224222240 in words is "one hundred five billion, two hundred twenty-four million, two hundred twenty-two thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •