Base | Representation |
---|---|
bin | 10110110010000110… |
… | …00110101100100010 |
3 | 1011120102112201101220 |
4 | 23121003012230202 |
5 | 200022214414242 |
6 | 5341413235510 |
7 | 612051135624 |
oct | 133103065442 |
9 | 34512481356 |
10 | 12231404322 |
11 | 5207344115 |
12 | 2454332b96 |
13 | 11cc096067 |
14 | 840656c14 |
15 | 4b8c2ebec |
hex | 2d90c6b22 |
12231404322 has 8 divisors (see below), whose sum is σ = 24462808656. Its totient is φ = 4077134772.
The previous prime is 12231404321. The next prime is 12231404323. The reversal of 12231404322 is 22340413221.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (12231404321) and next prime (12231404323).
It is a sphenic number, since it is the product of 3 distinct primes.
12231404322 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 12231404292 and 12231404301.
It is not an unprimeable number, because it can be changed into a prime (12231404321) 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, 1019283688 + ... + 1019283699.
It is an arithmetic number, because the mean of its divisors is an integer number (3057851082).
Almost surely, 212231404322 is an apocalyptic number.
12231404322 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12231404322 is a wasteful number, since it uses less digits than its factorization.
12231404322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2038567392.
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 12231404322 its reverse (22340413221), we get a palindrome (34571817543).
The spelling of 12231404322 in words is "twelve billion, two hundred thirty-one million, four hundred four thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •