Base | Representation |
---|---|
bin | 1001011001011101100010… |
… | …1001100100000101001111 |
3 | 1100120211100201001002120220 |
4 | 2112113120221210011033 |
5 | 2323244021431334411 |
6 | 33550532353442423 |
7 | 2114352100226640 |
oct | 226273051440517 |
9 | 40524321032526 |
10 | 10333031121231 |
11 | 3324239760615 |
12 | 11aa73b270413 |
13 | 59c52930bb80 |
14 | 27a19b0a36c7 |
15 | 12dbbc3bab06 |
hex | 965d8a6414f |
10333031121231 has 64 divisors (see below), whose sum is σ = 17214617957376. Its totient is φ = 5367555072000.
The previous prime is 10333031121223. The next prime is 10333031121239. The reversal of 10333031121231 is 13212113033301.
It is an interprime number because it is at equal distance from previous prime (10333031121223) and next prime (10333031121239).
It is not a de Polignac number, because 10333031121231 - 23 = 10333031121223 is a prime.
It is a super-2 number, since 2×103330311212312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10333031121239) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 67618671 + ... + 67771311.
It is an arithmetic number, because the mean of its divisors is an integer number (268978405584).
Almost surely, 210333031121231 is an apocalyptic number.
10333031121231 is a deficient number, since it is larger than the sum of its proper divisors (6881586836145).
10333031121231 is a wasteful number, since it uses less digits than its factorization.
10333031121231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156432.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 10333031121231 its reverse (13212113033301), we get a palindrome (23545144154532).
The spelling of 10333031121231 in words is "ten trillion, three hundred thirty-three billion, thirty-one million, one hundred twenty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •