Base | Representation |
---|---|
bin | 1110001001011101010011… |
… | …11111111010110001001111 |
3 | 11002011012201000010200220011 |
4 | 13010232221333322301033 |
5 | 13034211420324331343 |
6 | 150100200051534051 |
7 | 6360501010445323 |
oct | 704565177726117 |
9 | 132135630120804 |
10 | 31111300230223 |
11 | 9a05256a01294 |
12 | 35a56b35ba327 |
13 | 1448a243c0685 |
14 | 797b1b557983 |
15 | 38e42287129d |
hex | 1c4ba9ffac4f |
31111300230223 has 8 divisors (see below), whose sum is σ = 32464086893568. Its totient is φ = 29758523686584.
The previous prime is 31111300230203. The next prime is 31111300230331. The reversal of 31111300230223 is 32203200311113.
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 31111300230223 - 213 = 31111300222031 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 31111300230194 and 31111300230203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31111300230203) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4124886 + ... + 8901532.
It is an arithmetic number, because the mean of its divisors is an integer number (4058010861696).
Almost surely, 231111300230223 is an apocalyptic number.
31111300230223 is a deficient number, since it is larger than the sum of its proper divisors (1352786663345).
31111300230223 is a wasteful number, since it uses less digits than its factorization.
31111300230223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5059853.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 31111300230223 its reverse (32203200311113), we get a palindrome (63314500541336).
The spelling of 31111300230223 in words is "thirty-one trillion, one hundred eleven billion, three hundred million, two hundred thirty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •