Base | Representation |
---|---|
bin | 1001010100110000100010… |
… | …0011110001010111011001 |
3 | 1100022002210120110210121011 |
4 | 2111030020203301113121 |
5 | 2320433032003434041 |
6 | 33445450520413521 |
7 | 2105461554441430 |
oct | 225141043612731 |
9 | 40262716423534 |
10 | 10252230530521 |
11 | 32a2a4594a921 |
12 | 1196b4b3172a1 |
13 | 594a20378355 |
14 | 2762d3c88117 |
15 | 12ba3d9a9e81 |
hex | 953088f15d9 |
10252230530521 has 8 divisors (see below), whose sum is σ = 11826338022720. Its totient is φ = 8705498821008.
The previous prime is 10252230530519. The next prime is 10252230530537. The reversal of 10252230530521 is 12503503225201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10252230530521 - 21 = 10252230530519 is a prime.
It is a super-2 number, since 2×102522305305212 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10252230530221) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6843944866 + ... + 6843946363.
It is an arithmetic number, because the mean of its divisors is an integer number (1478292252840).
Almost surely, 210252230530521 is an apocalyptic number.
It is an amenable number.
10252230530521 is a deficient number, since it is larger than the sum of its proper divisors (1574107492199).
10252230530521 is a wasteful number, since it uses less digits than its factorization.
10252230530521 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13687891343.
The product of its (nonzero) digits is 18000, while the sum is 31.
Adding to 10252230530521 its reverse (12503503225201), we get a palindrome (22755733755722).
The spelling of 10252230530521 in words is "ten trillion, two hundred fifty-two billion, two hundred thirty million, five hundred thirty thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •