Base | Representation |
---|---|
bin | 10001011110100111110… |
… | …010110110100010001010 |
3 | 11020211021111020211011000 |
4 | 101132213302312202022 |
5 | 124134333404014401 |
6 | 2315441025115430 |
7 | 152530436025453 |
oct | 21364762664212 |
9 | 4224244224130 |
10 | 1201111001226 |
11 | 42342a935824 |
12 | 174949788b76 |
13 | 8935881ab96 |
14 | 421c3ccc12a |
15 | 2139c4e6186 |
hex | 117a7cb688a |
1201111001226 has 64 divisors (see below), whose sum is σ = 2731462272000. Its totient is φ = 391023058608.
The previous prime is 1201111001201. The next prime is 1201111001227. The reversal of 1201111001226 is 6221001111021.
It is a super-2 number, since 2×12011110012262 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 1201111001199 and 1201111001208.
It is not an unprimeable number, because it can be changed into a prime (1201111001227) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 37756075 + ... + 37787873.
It is an arithmetic number, because the mean of its divisors is an integer number (42679098000).
Almost surely, 21201111001226 is an apocalyptic number.
1201111001226 is an abundant number, since it is smaller than the sum of its proper divisors (1530351270774).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1201111001226 is a wasteful number, since it uses less digits than its factorization.
1201111001226 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48120 (or 48114 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 18.
Adding to 1201111001226 its reverse (6221001111021), we get a palindrome (7422112112247).
The spelling of 1201111001226 in words is "one trillion, two hundred one billion, one hundred eleven million, one thousand, two hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •