Base | Representation |
---|---|
bin | 10010001110011111101… |
… | …101100110001001101110 |
3 | 11102201221220222012011110 |
4 | 102032133231212021232 |
5 | 131010122320410410 |
6 | 2355221503332450 |
7 | 156330326643615 |
oct | 22163755461156 |
9 | 4381856865143 |
10 | 1252515013230 |
11 | 443209087878 |
12 | 1828b48b1126 |
13 | 9115b412530 |
14 | 4489cc9687c |
15 | 228aa274720 |
hex | 1239fb6626e |
1252515013230 has 64 divisors (see below), whose sum is σ = 3348899588160. Its totient is φ = 297679958016.
The previous prime is 1252515013199. The next prime is 1252515013261. The reversal of 1252515013230 is 323105152521.
It is an interprime number because it is at equal distance from previous prime (1252515013199) and next prime (1252515013261).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 55360707 + ... + 55383326.
It is an arithmetic number, because the mean of its divisors is an integer number (52326556065).
Almost surely, 21252515013230 is an apocalyptic number.
1252515013230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1252515013230 is an abundant number, since it is smaller than the sum of its proper divisors (2096384574930).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1252515013230 is a wasteful number, since it uses less digits than its factorization.
1252515013230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110744085.
The product of its (nonzero) digits is 9000, while the sum is 30.
The spelling of 1252515013230 in words is "one trillion, two hundred fifty-two billion, five hundred fifteen million, thirteen thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •