Base | Representation |
---|---|
bin | 1110001001100000111001… |
… | …00111000101111010010111 |
3 | 11002011101200000100201020012 |
4 | 13010300130213011322113 |
5 | 13034224340103231403 |
6 | 150101114541430435 |
7 | 6360566446544642 |
oct | 704603447057227 |
9 | 132141600321205 |
10 | 31113223102103 |
11 | 9a060533593aa |
12 | 35a5b4b56b41b |
13 | 1448c6c8a189c |
14 | 797c60a96a59 |
15 | 38e4d659aed8 |
hex | 1c4c1c9c5e97 |
31113223102103 has 4 divisors (see below), whose sum is σ = 31113260476200. Its totient is φ = 31113185728008.
The previous prime is 31113223102033. The next prime is 31113223102111. The reversal of 31113223102103 is 30120132231113.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 31113223102103 - 214 = 31113223085719 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 (31113223102153) 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 3 ways as a sum of consecutive naturals, for example, 17409200 + ... + 19112997.
It is an arithmetic number, because the mean of its divisors is an integer number (7778315119050).
Almost surely, 231113223102103 is an apocalyptic number.
31113223102103 is a deficient number, since it is larger than the sum of its proper divisors (37374097).
31113223102103 is an equidigital number, since it uses as much as digits as its factorization.
31113223102103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37374096.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 31113223102103 its reverse (30120132231113), we get a palindrome (61233355333216).
The spelling of 31113223102103 in words is "thirty-one trillion, one hundred thirteen billion, two hundred twenty-three million, one hundred two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •