Base | Representation |
---|---|
bin | 10100111011001100… |
… | …10100000101000110 |
3 | 1001222220202101120100 |
4 | 22131212110011012 |
5 | 141001401014342 |
6 | 5054423344530 |
7 | 545250302103 |
oct | 123546240506 |
9 | 31886671510 |
10 | 11234001222 |
11 | 4845334434 |
12 | 22162b2146 |
13 | 10a0557c02 |
14 | 787dc3aaa |
15 | 45b3b2e4c |
hex | 29d994146 |
11234001222 has 12 divisors (see below), whose sum is σ = 24340336020. Its totient is φ = 3744667068.
The previous prime is 11234001221. The next prime is 11234001257. The reversal of 11234001222 is 22210043211.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 624111179 = 11234001222 / (1 + 1 + 2 + 3 + 4 + 0 + 0 + 1 + 2 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 11234001195 and 11234001204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11234001221) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 312055572 + ... + 312055607.
It is an arithmetic number, because the mean of its divisors is an integer number (2028361335).
Almost surely, 211234001222 is an apocalyptic number.
11234001222 is an abundant number, since it is smaller than the sum of its proper divisors (13106334798).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11234001222 is a wasteful number, since it uses less digits than its factorization.
11234001222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 624111187 (or 624111184 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 11234001222 its reverse (22210043211), we get a palindrome (33444044433).
The spelling of 11234001222 in words is "eleven billion, two hundred thirty-four million, one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •