Base | Representation |
---|---|
bin | 10001100010010010010… |
… | …101101011100110111101 |
3 | 11021012102201122110202121 |
4 | 101202102111223212331 |
5 | 124220413234000221 |
6 | 2321331313522541 |
7 | 153030106665331 |
oct | 21422225534675 |
9 | 4235381573677 |
10 | 1205046000061 |
11 | 42506a062682 |
12 | 175667573451 |
13 | 89834b31167 |
14 | 424787617c1 |
15 | 2152cbcba41 |
hex | 1189256b9bd |
1205046000061 has 8 divisors (see below), whose sum is σ = 1214538494400. Its totient is φ = 1195584177120.
The previous prime is 1205046000043. The next prime is 1205046000079. The reversal of 1205046000061 is 1600006405021.
It is an interprime number because it is at equal distance from previous prime (1205046000043) and next prime (1205046000079).
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-1205046000061 is a prime.
It is a super-2 number, since 2×12050460000612 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1205046000001) 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, 7588960 + ... + 7746121.
It is an arithmetic number, because the mean of its divisors is an integer number (151817311800).
Almost surely, 21205046000061 is an apocalyptic number.
It is an amenable number.
1205046000061 is a deficient number, since it is larger than the sum of its proper divisors (9492494339).
1205046000061 is a wasteful number, since it uses less digits than its factorization.
1205046000061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15335699.
The product of its (nonzero) digits is 1440, while the sum is 25.
The spelling of 1205046000061 in words is "one trillion, two hundred five billion, forty-six million, sixty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •