Base | Representation |
---|---|
bin | 10001110101101010010… |
… | …010110000010010110111 |
3 | 11100012010112010101022122 |
4 | 101311222102300102313 |
5 | 130041014314340123 |
6 | 2335051445550155 |
7 | 154364452261466 |
oct | 21655222602267 |
9 | 4305115111278 |
10 | 1225848980663 |
11 | 43297487892a |
12 | 1796b241535b |
13 | 8b79b993538 |
14 | 4348d54a9dd |
15 | 21d491acbc8 |
hex | 11d6a4b04b7 |
1225848980663 has 4 divisors (see below), whose sum is σ = 1226692649688. Its totient is φ = 1225005311640.
The previous prime is 1225848980659. The next prime is 1225848980689. The reversal of 1225848980663 is 3660898485221.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1225848980663 - 22 = 1225848980659 is a prime.
It is a super-2 number, since 2×12258489806632 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1225848980596 and 1225848980605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1225848980623) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 421832333 + ... + 421835238.
It is an arithmetic number, because the mean of its divisors is an integer number (306673162422).
Almost surely, 21225848980663 is an apocalyptic number.
1225848980663 is a deficient number, since it is larger than the sum of its proper divisors (843669025).
1225848980663 is an equidigital number, since it uses as much as digits as its factorization.
1225848980663 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 843669024.
The product of its (nonzero) digits is 39813120, while the sum is 62.
The spelling of 1225848980663 in words is "one trillion, two hundred twenty-five billion, eight hundred forty-eight million, nine hundred eighty thousand, six hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •