Base | Representation |
---|---|
bin | 1001011110100111001010… |
… | …1101101111001100110011 |
3 | 1100220021202022112200210001 |
4 | 2113221302231233030303 |
5 | 2331221230401040111 |
6 | 34055324503450431 |
7 | 2123633602024135 |
oct | 227516255571463 |
9 | 40807668480701 |
10 | 10421515252531 |
11 | 3358815743059 |
12 | 1203914456a17 |
13 | 5a798b074006 |
14 | 28059292b055 |
15 | 13114a6161c1 |
hex | 97a72b6f333 |
10421515252531 has 8 divisors (see below), whose sum is σ = 10553631945920. Its totient is φ = 10289403528768.
The previous prime is 10421515252403. The next prime is 10421515252543. The reversal of 10421515252531 is 13525251512401.
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 10421515252531 - 27 = 10421515252403 is a prime.
It is a super-2 number, since 2×104215152525312 (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 (10421515252571) 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, 3072655 + ... + 5503111.
It is an arithmetic number, because the mean of its divisors is an integer number (1319203993240).
Almost surely, 210421515252531 is an apocalyptic number.
10421515252531 is a deficient number, since it is larger than the sum of its proper divisors (132116693389).
10421515252531 is an equidigital number, since it uses as much as digits as its factorization.
10421515252531 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2484813.
The product of its (nonzero) digits is 60000, while the sum is 37.
Adding to 10421515252531 its reverse (13525251512401), we get a palindrome (23946766764932).
The spelling of 10421515252531 in words is "ten trillion, four hundred twenty-one billion, five hundred fifteen million, two hundred fifty-two thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •