Base | Representation |
---|---|
bin | 1010100111000101011110… |
… | …10010110111101000011011 |
3 | 10001121122002001112210000002 |
4 | 11103202233102313220123 |
5 | 11024242400021424011 |
6 | 121343043045003215 |
7 | 4625524346500610 |
oct | 523425722675033 |
9 | 101548061483002 |
10 | 23333203311131 |
11 | 7486612a7910a |
12 | 274a16a6b350b |
13 | 10034088652ac |
14 | 5a9493d0c507 |
15 | 2a6e3bc16c3b |
hex | 1538af4b7a1b |
23333203311131 has 32 divisors (see below), whose sum is σ = 28511227450368. Its totient is φ = 18639389260800.
The previous prime is 23333203311091. The next prime is 23333203311139. The reversal of 23333203311131 is 13111330233332.
It is not a de Polignac number, because 23333203311131 - 210 = 23333203310107 is a prime.
It is a super-2 number, since 2×233332033111312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23333203311094 and 23333203311103.
It is not an unprimeable number, because it can be changed into a prime (23333203311139) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 203813456 + ... + 203927906.
It is an arithmetic number, because the mean of its divisors is an integer number (890975857824).
Almost surely, 223333203311131 is an apocalyptic number.
23333203311131 is a deficient number, since it is larger than the sum of its proper divisors (5178024139237).
23333203311131 is a wasteful number, since it uses less digits than its factorization.
23333203311131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131211.
The product of its (nonzero) digits is 8748, while the sum is 29.
Adding to 23333203311131 its reverse (13111330233332), we get a palindrome (36444533544463).
The spelling of 23333203311131 in words is "twenty-three trillion, three hundred thirty-three billion, two hundred three million, three hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •