Base | Representation |
---|---|
bin | 1010111011100001010010… |
… | …1111100111010010010100 |
3 | 1120112212200211202022112212 |
4 | 2232320110233213102110 |
5 | 3033344140112121322 |
6 | 41320501220532552 |
7 | 2350150656654233 |
oct | 256702457472224 |
9 | 46485624668485 |
10 | 12017666520212 |
11 | 39137334a5a31 |
12 | 1421130251158 |
13 | 6923517cc542 |
14 | 2d792dddcb1a |
15 | 15c918da50e2 |
hex | aee14be7494 |
12017666520212 has 6 divisors (see below), whose sum is σ = 21030916410378. Its totient is φ = 6008833260104.
The previous prime is 12017666520169. The next prime is 12017666520217. The reversal of 12017666520212 is 21202566671021.
It can be written as a sum of positive squares in only one way, i.e., 9869436932356 + 2148229587856 = 3141566^2 + 1465684^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 12017666520212.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12017666520217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1502208315023 + ... + 1502208315030.
It is an arithmetic number, because the mean of its divisors is an integer number (3505152735063).
Almost surely, 212017666520212 is an apocalyptic number.
It is an amenable number.
12017666520212 is a deficient number, since it is larger than the sum of its proper divisors (9013249890166).
12017666520212 is a wasteful number, since it uses less digits than its factorization.
12017666520212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3004416630057 (or 3004416630055 counting only the distinct ones).
The product of its (nonzero) digits is 120960, while the sum is 41.
The spelling of 12017666520212 in words is "twelve trillion, seventeen billion, six hundred sixty-six million, five hundred twenty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •