Base | Representation |
---|---|
bin | 1101100100011110110… |
… | …0100100011111100011 |
3 | 211021202022021221210001 |
4 | 3121013230210133203 |
5 | 12304423030201011 |
6 | 255033212320431 |
7 | 22562130440446 |
oct | 3310754443743 |
9 | 737668257701 |
10 | 233131100131 |
11 | 8a963479096 |
12 | 39223173117 |
13 | 18ca42aac37 |
14 | b3d82db65d |
15 | 60e6ddb7c1 |
hex | 3647b247e3 |
233131100131 has 4 divisors (see below), whose sum is σ = 238091336352. Its totient is φ = 228170863912.
The previous prime is 233131100129. The next prime is 233131100149. The reversal of 233131100131 is 131001131332.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 233131100131 - 21 = 233131100129 is a prime.
It is a super-2 number, since 2×2331311001312 (a number of 24 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 = 233131100099 and 233131100108.
It is not an unprimeable number, because it can be changed into a prime (233131110131) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2480118040 + ... + 2480118133.
It is an arithmetic number, because the mean of its divisors is an integer number (59522834088).
Almost surely, 2233131100131 is an apocalyptic number.
233131100131 is a deficient number, since it is larger than the sum of its proper divisors (4960236221).
233131100131 is an equidigital number, since it uses as much as digits as its factorization.
233131100131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4960236220.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 233131100131 its reverse (131001131332), we get a palindrome (364132231463).
The spelling of 233131100131 in words is "two hundred thirty-three billion, one hundred thirty-one million, one hundred thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •