Base | Representation |
---|---|
bin | 1110111010000011010… |
… | …00100101011000000000 |
3 | 1210222002020221001112110 |
4 | 13131001220211120000 |
5 | 31342442240003422 |
6 | 1031145200055320 |
7 | 52001564266245 |
oct | 7350150453000 |
9 | 1728066831473 |
10 | 512202266112 |
11 | 18825090a649 |
12 | 83327604540 |
13 | 393ba181194 |
14 | 1ab0da535cc |
15 | d4cc00960c |
hex | 7741a25600 |
512202266112 has 160 divisors (see below), whose sum is σ = 1432951356672. Its totient is φ = 162268913664.
The previous prime is 512202266099. The next prime is 512202266123. The reversal of 512202266112 is 211662202215.
It is a super-2 number, since 2×5122022661122 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 512202266112.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5500323 + ... + 5592669.
Almost surely, 2512202266112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 512202266112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (716475678336).
512202266112 is an abundant number, since it is smaller than the sum of its proper divisors (920749090560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
512202266112 is a wasteful number, since it uses less digits than its factorization.
512202266112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92548 (or 92532 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 30.
Adding to 512202266112 its reverse (211662202215), we get a palindrome (723864468327).
The spelling of 512202266112 in words is "five hundred twelve billion, two hundred two million, two hundred sixty-six thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •