Base | Representation |
---|---|
bin | 10110110010010011… |
… | …01100110101110111 |
3 | 1011120112210120021222 |
4 | 23121021230311313 |
5 | 200023140232211 |
6 | 5341514300555 |
7 | 612101630021 |
oct | 133111546567 |
9 | 34515716258 |
10 | 12233133431 |
11 | 5208315232 |
12 | 2454a2775b |
13 | 11cc5500bc |
14 | 840987011 |
15 | 4b8e721db |
hex | 2d926cd77 |
12233133431 has 4 divisors (see below), whose sum is σ = 12433676664. Its totient is φ = 12032590200.
The previous prime is 12233133421. The next prime is 12233133443. The reversal of 12233133431 is 13433133221.
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 12233133431 - 214 = 12233117047 is a prime.
It is a super-4 number, since 4×122331334314 (a number of 41 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12233133431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12233133401) 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, 100271525 + ... + 100271646.
It is an arithmetic number, because the mean of its divisors is an integer number (3108419166).
Almost surely, 212233133431 is an apocalyptic number.
12233133431 is a deficient number, since it is larger than the sum of its proper divisors (200543233).
12233133431 is an equidigital number, since it uses as much as digits as its factorization.
12233133431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 200543232.
The product of its digits is 3888, while the sum is 26.
Adding to 12233133431 its reverse (13433133221), we get a palindrome (25666266652).
The spelling of 12233133431 in words is "twelve billion, two hundred thirty-three million, one hundred thirty-three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.322 sec. • engine limits •