Base | Representation |
---|---|
bin | 10010000101001101010… |
… | …000001000010101110101 |
3 | 11101210012212021110021222 |
4 | 102011031100020111311 |
5 | 130324211123411040 |
6 | 2350452111120125 |
7 | 155525224346261 |
oct | 22051520102565 |
9 | 4353185243258 |
10 | 1242541622645 |
11 | 439a60397914 |
12 | 180990813045 |
13 | 9022c0b099b |
14 | 441d449d0a1 |
15 | 224c48c0bb5 |
hex | 1214d408575 |
1242541622645 has 8 divisors (see below), whose sum is σ = 1578758767704. Its totient is φ = 935560751104.
The previous prime is 1242541622599. The next prime is 1242541622681. The reversal of 1242541622645 is 5462261452421.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 310696989604 + 931844633041 = 557402^2 + 965321^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1242541622645 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1242541622596 and 1242541622605.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7309068284 + ... + 7309068453.
It is an arithmetic number, because the mean of its divisors is an integer number (197344845963).
Almost surely, 21242541622645 is an apocalyptic number.
It is an amenable number.
1242541622645 is a deficient number, since it is larger than the sum of its proper divisors (336217145059).
1242541622645 is a wasteful number, since it uses less digits than its factorization.
1242541622645 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14618136759.
The product of its digits is 921600, while the sum is 44.
The spelling of 1242541622645 in words is "one trillion, two hundred forty-two billion, five hundred forty-one million, six hundred twenty-two thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •