Base | Representation |
---|---|
bin | 10001100001100001001… |
… | …111001000110100100110 |
3 | 11021010022022112011001221 |
4 | 101201201033020310212 |
5 | 124212221340414001 |
6 | 2321113445010554 |
7 | 153000514551220 |
oct | 21414117106446 |
9 | 4233268464057 |
10 | 1204222201126 |
11 | 42478704730a |
12 | 1754776b3a5a |
13 | 89733267979 |
14 | 423db19d410 |
15 | 214d07031a1 |
hex | 118613c8d26 |
1204222201126 has 8 divisors (see below), whose sum is σ = 2064380916240. Its totient is φ = 516095229048.
The previous prime is 1204222200967. The next prime is 1204222201187. The reversal of 1204222201126 is 6211022224021.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×12042222011262 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1204222201126.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 43007935741 + ... + 43007935768.
It is an arithmetic number, because the mean of its divisors is an integer number (258047614530).
Almost surely, 21204222201126 is an apocalyptic number.
1204222201126 is a deficient number, since it is larger than the sum of its proper divisors (860158715114).
1204222201126 is an equidigital number, since it uses as much as digits as its factorization.
1204222201126 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86015871518.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 1204222201126 its reverse (6211022224021), we get a palindrome (7415244425147).
The spelling of 1204222201126 in words is "one trillion, two hundred four billion, two hundred twenty-two million, two hundred one thousand, one hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •