Base | Representation |
---|---|
bin | 1110001100011001000101… |
… | …11010111101110111011101 |
3 | 11002111211220211120100202101 |
4 | 13012030202322331313131 |
5 | 13042334401441120013 |
6 | 150214351420125101 |
7 | 6401000155653463 |
oct | 706144272756735 |
9 | 132454824510671 |
10 | 31212113223133 |
11 | 9a43a8a241a57 |
12 | 3601149696791 |
13 | 145539c481bbb |
14 | 79c962566833 |
15 | 391d7314c8dd |
hex | 1c6322ebdddd |
31212113223133 has 4 divisors (see below), whose sum is σ = 31239230611968. Its totient is φ = 31184995834300.
The previous prime is 31212113223103. The next prime is 31212113223149. The reversal of 31212113223133 is 33132231121213.
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 31212113223133 - 29 = 31212113222621 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 (31212113223103) 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, 13558692691 + ... + 13558694992.
It is an arithmetic number, because the mean of its divisors is an integer number (7809807652992).
Almost surely, 231212113223133 is an apocalyptic number.
It is an amenable number.
31212113223133 is a deficient number, since it is larger than the sum of its proper divisors (27117388835).
31212113223133 is a wasteful number, since it uses less digits than its factorization.
31212113223133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27117388834.
The product of its digits is 3888, while the sum is 28.
Adding to 31212113223133 its reverse (33132231121213), we get a palindrome (64344344344346).
The spelling of 31212113223133 in words is "thirty-one trillion, two hundred twelve billion, one hundred thirteen million, two hundred twenty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •