Base | Representation |
---|---|
bin | 10001110000100010110… |
… | …001100001101100000101 |
3 | 11022122221120120120011112 |
4 | 101300202301201230011 |
5 | 124443241123323303 |
6 | 2332342320014405 |
7 | 154111340605046 |
oct | 21604261415405 |
9 | 4278846516145 |
10 | 1220354120453 |
11 | 4306050a5046 |
12 | 17861a161405 |
13 | 8b10445c170 |
14 | 430cb8708cd |
15 | 21b26aa60d8 |
hex | 11c22c61b05 |
1220354120453 has 8 divisors (see below), whose sum is σ = 1315824400128. Its totient is φ = 1125111967344.
The previous prime is 1220354120441. The next prime is 1220354120467. The reversal of 1220354120453 is 3540214530221.
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 1220354120453 - 28 = 1220354120197 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1220354123453) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 57020525 + ... + 57041922.
It is an arithmetic number, because the mean of its divisors is an integer number (164478050016).
Almost surely, 21220354120453 is an apocalyptic number.
1220354120453 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1220354120453 is a deficient number, since it is larger than the sum of its proper divisors (95470279675).
1220354120453 is a wasteful number, since it uses less digits than its factorization.
1220354120453 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 114063283.
The product of its (nonzero) digits is 28800, while the sum is 32.
Adding to 1220354120453 its reverse (3540214530221), we get a palindrome (4760568650674).
The spelling of 1220354120453 in words is "one trillion, two hundred twenty billion, three hundred fifty-four million, one hundred twenty thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •