Base | Representation |
---|---|
bin | 10101001100000100… |
… | …110000000000101101 |
3 | 2011201120022011201211 |
4 | 111030010300000231 |
5 | 333043243301000 |
6 | 14241324034421 |
7 | 1433536404514 |
oct | 251404600055 |
9 | 64646264654 |
10 | 22751150125 |
11 | 9715481910 |
12 | 44ab392a11 |
13 | 21b7660112 |
14 | 115b83167b |
15 | 8d25567ba |
hex | 54c13002d |
22751150125 has 16 divisors (see below), whose sum is σ = 30974658624. Its totient is φ = 16546290000.
The previous prime is 22751150119. The next prime is 22751150129. The reversal of 22751150125 is 52105115722.
It is a happy number.
It is a de Polignac number, because none of the positive numbers 2k-22751150125 is a prime.
It is a super-2 number, since 2×227511501252 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22751150129) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8271771 + ... + 8274520.
It is an arithmetic number, because the mean of its divisors is an integer number (1935916164).
Almost surely, 222751150125 is an apocalyptic number.
22751150125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
22751150125 is a deficient number, since it is larger than the sum of its proper divisors (8223508499).
22751150125 is a wasteful number, since it uses less digits than its factorization.
22751150125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16546317 (or 16546307 counting only the distinct ones).
The product of its (nonzero) digits is 7000, while the sum is 31.
Adding to 22751150125 its reverse (52105115722), we get a palindrome (74856265847).
The spelling of 22751150125 in words is "twenty-two billion, seven hundred fifty-one million, one hundred fifty thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •