Base | Representation |
---|---|
bin | 110000111111111011… |
… | …0100011001011110001 |
3 | 101001121020221021210010 |
4 | 1201333312203023301 |
5 | 3210444400041200 |
6 | 120201144125133 |
7 | 10413361060521 |
oct | 1417766431361 |
9 | 331536837703 |
10 | 105224221425 |
11 | 40697369a74 |
12 | 184874667a9 |
13 | 9bcbc5631b |
14 | 5142c0b681 |
15 | 2b0cbd2150 |
hex | 187fda32f1 |
105224221425 has 24 divisors (see below), whose sum is σ = 178213906080. Its totient is φ = 54750812800.
The previous prime is 105224221397. The next prime is 105224221483. The reversal of 105224221425 is 524122422501.
It is not a de Polignac number, because 105224221425 - 210 = 105224220401 is a prime.
It is a super-2 number, since 2×1052242214252 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 105224221392 and 105224221401.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 17106555 + ... + 17112704.
It is an arithmetic number, because the mean of its divisors is an integer number (7425579420).
Almost surely, 2105224221425 is an apocalyptic number.
105224221425 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
105224221425 is a deficient number, since it is larger than the sum of its proper divisors (72989684655).
105224221425 is a wasteful number, since it uses less digits than its factorization.
105224221425 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34219313 (or 34219308 counting only the distinct ones).
The product of its (nonzero) digits is 12800, while the sum is 30.
Adding to 105224221425 its reverse (524122422501), we get a palindrome (629346643926).
The spelling of 105224221425 in words is "one hundred five billion, two hundred twenty-four million, two hundred twenty-one thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •