Base | Representation |
---|---|
bin | 1110000110100110101000… |
… | …00010001100101001100101 |
3 | 11001210211112201011220100120 |
4 | 13003103110002030221211 |
5 | 13031110034113114023 |
6 | 145543135510232153 |
7 | 6350426350602021 |
oct | 703232402145145 |
9 | 131724481156316 |
10 | 31013221223013 |
11 | 99776a695a537 |
12 | 358a6a1055659 |
13 | 143c6c3884a73 |
14 | 7930956a7381 |
15 | 38bad20de8e3 |
hex | 1c34d408ca65 |
31013221223013 has 8 divisors (see below), whose sum is σ = 41357262275808. Its totient is φ = 20672330492784.
The previous prime is 31013221222987. The next prime is 31013221223057. The reversal of 31013221223013 is 31032212231013.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 31013221223013 - 25 = 31013221222981 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31013221223813) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 787557670 + ... + 787597047.
It is an arithmetic number, because the mean of its divisors is an integer number (5169657784476).
Almost surely, 231013221223013 is an apocalyptic number.
It is an amenable number.
31013221223013 is a deficient number, since it is larger than the sum of its proper divisors (10344041052795).
31013221223013 is a wasteful number, since it uses less digits than its factorization.
31013221223013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1575161283.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 31013221223013 its reverse (31032212231013), we get a palindrome (62045433454026).
The spelling of 31013221223013 in words is "thirty-one trillion, thirteen billion, two hundred twenty-one million, two hundred twenty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •