Base | Representation |
---|---|
bin | 1001011000001011100000… |
… | …0101110001010110101101 |
3 | 1100111201112000110210210012 |
4 | 2112002320011301112231 |
5 | 2322413422031443041 |
6 | 33532451305223005 |
7 | 2112642304111520 |
oct | 226027005612655 |
9 | 40451460423705 |
10 | 10311010031021 |
11 | 331596939a607 |
12 | 11a6414491a65 |
13 | 59a429cb448b |
14 | 2790ac5d2bb7 |
15 | 12d32dec33eb |
hex | 960b81715ad |
10311010031021 has 8 divisors (see below), whose sum is σ = 11809462896384. Its totient is φ = 8818920023760.
The previous prime is 10311010030963. The next prime is 10311010031083. The reversal of 10311010031021 is 12013001011301.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10311010031021 - 218 = 10311009768877 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10311010030987 and 10311010031005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10311010031521) 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, 1590711050 + ... + 1590717531.
It is an arithmetic number, because the mean of its divisors is an integer number (1476182862048).
Almost surely, 210311010031021 is an apocalyptic number.
It is an amenable number.
10311010031021 is a deficient number, since it is larger than the sum of its proper divisors (1498452865363).
10311010031021 is an equidigital number, since it uses as much as digits as its factorization.
10311010031021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3181429051.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 10311010031021 its reverse (12013001011301), we get a palindrome (22324011042322).
The spelling of 10311010031021 in words is "ten trillion, three hundred eleven billion, ten million, thirty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •