Base | Representation |
---|---|
bin | 1110000111001011101011… |
… | …01011011010111001001111 |
3 | 11001212201220000010101222221 |
4 | 13003211311223122321033 |
5 | 13031421303413431343 |
6 | 150000225412520211 |
7 | 6352032320302033 |
oct | 703456553327117 |
9 | 131781800111887 |
10 | 31033113030223 |
11 | 9985084301727 |
12 | 3592512920067 |
13 | 1441543a0aaa5 |
14 | 7940214681c3 |
15 | 38c3985d85ed |
hex | 1c3975adae4f |
31033113030223 has 8 divisors (see below), whose sum is σ = 31136169561728. Its totient is φ = 30930162691104.
The previous prime is 31033113030203. The next prime is 31033113030263. The reversal of 31033113030223 is 32203031133013.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31033113030223 is a prime.
It is a super-2 number, since 2×310331130302232 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31033113030203) 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, 25962636 + ... + 27131617.
It is an arithmetic number, because the mean of its divisors is an integer number (3892021195216).
Almost surely, 231033113030223 is an apocalyptic number.
31033113030223 is a deficient number, since it is larger than the sum of its proper divisors (103056531505).
31033113030223 is a wasteful number, since it uses less digits than its factorization.
31033113030223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53096193.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 31033113030223 its reverse (32203031133013), we get a palindrome (63236144163236).
The spelling of 31033113030223 in words is "thirty-one trillion, thirty-three billion, one hundred thirteen million, thirty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •