Base | Representation |
---|---|
bin | 1011000111010100001110… |
… | …0000000101000111011001 |
3 | 1121021020202201120021100012 |
4 | 2301311003200011013121 |
5 | 3100204200444041103 |
6 | 41553533541051305 |
7 | 2400613532604401 |
oct | 261650340050731 |
9 | 47236681507305 |
10 | 12220314440153 |
11 | 3991673a11616 |
12 | 14544666b6b35 |
13 | 6a84a859c041 |
14 | 303675a37801 |
15 | 162d29a232d8 |
hex | b1d438051d9 |
12220314440153 has 8 divisors (see below), whose sum is σ = 12322563075840. Its totient is φ = 12118346323200.
The previous prime is 12220314440137. The next prime is 12220314440177. The reversal of 12220314440153 is 35104441302221.
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 12220314440153 - 24 = 12220314440137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12220314400153) by changing a digit.
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, 70042193 + ... + 70216446.
It is an arithmetic number, because the mean of its divisors is an integer number (1540320384480).
Almost surely, 212220314440153 is an apocalyptic number.
It is an amenable number.
12220314440153 is a deficient number, since it is larger than the sum of its proper divisors (102248635687).
12220314440153 is a wasteful number, since it uses less digits than its factorization.
12220314440153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140259367.
The product of its (nonzero) digits is 23040, while the sum is 32.
Adding to 12220314440153 its reverse (35104441302221), we get a palindrome (47324755742374).
The spelling of 12220314440153 in words is "twelve trillion, two hundred twenty billion, three hundred fourteen million, four hundred forty thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •