Base | Representation |
---|---|
bin | 1110001100100111110011… |
… | …10011011000011000000101 |
3 | 11002112121022101222000102011 |
4 | 13012103321303120120011 |
5 | 13043002041401201201 |
6 | 150222135350214221 |
7 | 6401400014354254 |
oct | 706237163303005 |
9 | 132477271860364 |
10 | 31220013303301 |
11 | 9a47373673129 |
12 | 3602793354371 |
13 | 145605b0abb54 |
14 | 79d0b186079b |
15 | 3921869ac151 |
hex | 1c64f9cd8605 |
31220013303301 has 4 divisors (see below), whose sum is σ = 31946060124352. Its totient is φ = 30493966482252.
The previous prime is 31220013303263. The next prime is 31220013303329. The reversal of 31220013303301 is 10330331002213.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 31220013303301 - 231 = 31217865819653 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31220013343301) 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, 363023410461 + ... + 363023410546.
It is an arithmetic number, because the mean of its divisors is an integer number (7986515031088).
Almost surely, 231220013303301 is an apocalyptic number.
It is an amenable number.
31220013303301 is a deficient number, since it is larger than the sum of its proper divisors (726046821051).
31220013303301 is an equidigital number, since it uses as much as digits as its factorization.
31220013303301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 726046821050.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 31220013303301 its reverse (10330331002213), we get a palindrome (41550344305514).
The spelling of 31220013303301 in words is "thirty-one trillion, two hundred twenty billion, thirteen million, three hundred three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •