Base | Representation |
---|---|
bin | 1001011110100110100110… |
… | …1000111111010110100111 |
3 | 1100220021100201002010110001 |
4 | 2113221221220333112213 |
5 | 2331220422412404111 |
6 | 34055301424442131 |
7 | 2123630043016165 |
oct | 227515150772647 |
9 | 40807321063401 |
10 | 10421363013031 |
11 | 3358747811293 |
12 | 1203891479347 |
13 | 5a796566c979 |
14 | 28057a61c235 |
15 | 13113c0931c1 |
hex | 97a69a3f5a7 |
10421363013031 has 4 divisors (see below), whose sum is σ = 10874465752752. Its totient is φ = 9968260273312.
The previous prime is 10421363012987. The next prime is 10421363013049. The reversal of 10421363013031 is 13031036312401.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10421363013031 - 27 = 10421363012903 is a prime.
It is a super-2 number, since 2×104213630130312 (a number of 27 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 (10421363413031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 226551369826 + ... + 226551369871.
It is an arithmetic number, because the mean of its divisors is an integer number (2718616438188).
Almost surely, 210421363013031 is an apocalyptic number.
10421363013031 is a deficient number, since it is larger than the sum of its proper divisors (453102739721).
10421363013031 is an equidigital number, since it uses as much as digits as its factorization.
10421363013031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 453102739720.
The product of its (nonzero) digits is 3888, while the sum is 28.
Adding to 10421363013031 its reverse (13031036312401), we get a palindrome (23452399325432).
The spelling of 10421363013031 in words is "ten trillion, four hundred twenty-one billion, three hundred sixty-three million, thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •