Base | Representation |
---|---|
bin | 10110110010011011… |
… | …10110010111010101 |
3 | 1011120121211211011210 |
4 | 23121031312113111 |
5 | 200023430033023 |
6 | 5341553452033 |
7 | 612114106560 |
oct | 133115662725 |
9 | 34517754153 |
10 | 12234221013 |
11 | 5208998363 |
12 | 2455271019 |
13 | 11cc841141 |
14 | 840b8b4d7 |
15 | 4b90d9593 |
hex | 2d93765d5 |
12234221013 has 8 divisors (see below), whose sum is σ = 18642622528. Its totient is φ = 6990983424.
The previous prime is 12234221009. The next prime is 12234221057. The reversal of 12234221013 is 31012243221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12234221013 - 22 = 12234221009 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 582581953 = 12234221013 / (1 + 2 + 2 + 3 + 4 + 2 + 2 + 1 + 0 + 1 + 3).
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12234221063) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 291290956 + ... + 291290997.
It is an arithmetic number, because the mean of its divisors is an integer number (2330327816).
Almost surely, 212234221013 is an apocalyptic number.
It is an amenable number.
12234221013 is a deficient number, since it is larger than the sum of its proper divisors (6408401515).
12234221013 is an equidigital number, since it uses as much as digits as its factorization.
12234221013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 582581963.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 12234221013 its reverse (31012243221), we get a palindrome (43246464234).
The spelling of 12234221013 in words is "twelve billion, two hundred thirty-four million, two hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •