Base | Representation |
---|---|
bin | 1110000110100110100111… |
… | …00100000011011111110001 |
3 | 11001210211112011022110002212 |
4 | 13003103103210003133301 |
5 | 13031110030102234301 |
6 | 145543135025021505 |
7 | 6350426223461456 |
oct | 703232344033761 |
9 | 131724464273085 |
10 | 31013213321201 |
11 | 99776a2452811 |
12 | 358a69a484895 |
13 | 143c6c2049237 |
14 | 79309460b82d |
15 | 38bad157d4bb |
hex | 1c34d39037f1 |
31013213321201 has 8 divisors (see below), whose sum is σ = 32928989408640. Its totient is φ = 29107600502848.
The previous prime is 31013213321093. The next prime is 31013213321221. The reversal of 31013213321201 is 10212331231013.
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 31013213321201 - 222 = 31013209126897 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (31013213321221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2540810981 + ... + 2540823186.
It is an arithmetic number, because the mean of its divisors is an integer number (4116123676080).
Almost surely, 231013213321201 is an apocalyptic number.
It is an amenable number.
31013213321201 is a deficient number, since it is larger than the sum of its proper divisors (1915776087439).
31013213321201 is a wasteful number, since it uses less digits than its factorization.
31013213321201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5081634543.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 31013213321201 its reverse (10212331231013), we get a palindrome (41225544552214).
The spelling of 31013213321201 in words is "thirty-one trillion, thirteen billion, two hundred thirteen million, three hundred twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •