Base | Representation |
---|---|
bin | 1001001111000000010111… |
… | …1111100111011111000111 |
3 | 1022221122201010111210220121 |
4 | 2103300011333213133013 |
5 | 2312323132213010011 |
6 | 33332224205042411 |
7 | 2065362540432124 |
oct | 223600577473707 |
9 | 38848633453817 |
10 | 10153403250631 |
11 | 32650414887a3 |
12 | 117b96a256407 |
13 | 5886007cb244 |
14 | 2715da89574b |
15 | 1291a76bce71 |
hex | 93c05fe77c7 |
10153403250631 has 8 divisors (see below), whose sum is σ = 10751861875824. Its totient is φ = 9555077915520.
The previous prime is 10153403250629. The next prime is 10153403250691. The reversal of 10153403250631 is 13605230435101.
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 10153403250631 - 21 = 10153403250629 is a prime.
It is a super-2 number, since 2×101534032506312 (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 (10153403250691) 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, 33165660 + ... + 33470401.
It is an arithmetic number, because the mean of its divisors is an integer number (1343982734478).
Almost surely, 210153403250631 is an apocalyptic number.
10153403250631 is a deficient number, since it is larger than the sum of its proper divisors (598458625193).
10153403250631 is an equidigital number, since it uses as much as digits as its factorization.
10153403250631 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 66645041.
The product of its (nonzero) digits is 32400, while the sum is 34.
Adding to 10153403250631 its reverse (13605230435101), we get a palindrome (23758633685732).
The spelling of 10153403250631 in words is "ten trillion, one hundred fifty-three billion, four hundred three million, two hundred fifty thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •