Base | Representation |
---|---|
bin | 1001001101110100011101… |
… | …0011000001111100111011 |
3 | 1022212201002212101202020021 |
4 | 2103131013103001330323 |
5 | 2312004413122203311 |
6 | 33315014051311311 |
7 | 2064041532025300 |
oct | 223350723017473 |
9 | 38781085352207 |
10 | 10133024022331 |
11 | 3257433990961 |
12 | 1177a212ab537 |
13 | 5867036a5782 |
14 | 2706260950a7 |
15 | 1288b34e3171 |
hex | 937474c1f3b |
10133024022331 has 24 divisors (see below), whose sum is σ = 11834607074640. Its totient is φ = 8650727672832.
The previous prime is 10133024022313. The next prime is 10133024022347. The reversal of 10133024022331 is 13322042033101.
It is not a de Polignac number, because 10133024022331 - 25 = 10133024022299 is a prime.
It is a super-2 number, since 2×101330240223312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10133024022296 and 10133024022305.
It is not an unprimeable number, because it can be changed into a prime (10133024022301) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 12493195 + ... + 13279531.
It is an arithmetic number, because the mean of its divisors is an integer number (493108628110).
Almost surely, 210133024022331 is an apocalyptic number.
10133024022331 is a deficient number, since it is larger than the sum of its proper divisors (1701583052309).
10133024022331 is an equidigital number, since it uses as much as digits as its factorization.
10133024022331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 787403 (or 787396 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 10133024022331 its reverse (13322042033101), we get a palindrome (23455066055432).
The spelling of 10133024022331 in words is "ten trillion, one hundred thirty-three billion, twenty-four million, twenty-two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •