Base | Representation |
---|---|
bin | 10001110010011010111… |
… | …011100001000000110101 |
3 | 11022212011001211002221211 |
4 | 101302122323201000311 |
5 | 130011403210130140 |
6 | 2333314331241421 |
7 | 154212316415440 |
oct | 21623273410065 |
9 | 4285131732854 |
10 | 1222370005045 |
11 | 43144a000a72 |
12 | 178aa12a9271 |
13 | 8b365ca8697 |
14 | 4323d4a2657 |
15 | 21be3a552ea |
hex | 11c9aee1035 |
1222370005045 has 8 divisors (see below), whose sum is σ = 1676393149824. Its totient is φ = 838196574864.
The previous prime is 1222370005039. The next prime is 1222370005063. The reversal of 1222370005045 is 5405000732221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1222370005045 - 29 = 1222370004533 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1222370004998 and 1222370005016.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17462428609 + ... + 17462428678.
It is an arithmetic number, because the mean of its divisors is an integer number (209549143728).
Almost surely, 21222370005045 is an apocalyptic number.
It is an amenable number.
1222370005045 is a deficient number, since it is larger than the sum of its proper divisors (454023144779).
1222370005045 is an equidigital number, since it uses as much as digits as its factorization.
1222370005045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34924857299.
The product of its (nonzero) digits is 16800, while the sum is 31.
Adding to 1222370005045 its reverse (5405000732221), we get a palindrome (6627370737266).
The spelling of 1222370005045 in words is "one trillion, two hundred twenty-two billion, three hundred seventy million, five thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •