Base | Representation |
---|---|
bin | 1110101111010110011110… |
… | …1111111000011110001010 |
3 | 2010101100012110100221010002 |
4 | 3223311213233320132022 |
5 | 4111012210431310010 |
6 | 54245122214123002 |
7 | 3261614643603041 |
oct | 353654757703612 |
9 | 63340173327102 |
10 | 16206652213130 |
11 | 5189225738875 |
12 | 1998b5b050462 |
13 | 907385a50672 |
14 | 4005986a7558 |
15 | 1d188b36b1a5 |
hex | ebd67bf878a |
16206652213130 has 8 divisors (see below), whose sum is σ = 29171973983652. Its totient is φ = 6482660885248.
The previous prime is 16206652213127. The next prime is 16206652213139. The reversal of 16206652213130 is 3131225660261.
It can be written as a sum of positive squares in 2 ways, for example, as 14732232151081 + 1474420062049 = 3838259^2 + 1214257^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×162066522131303 (a number of 41 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (16206652213139) 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, 810332610647 + ... + 810332610666.
Almost surely, 216206652213130 is an apocalyptic number.
16206652213130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
16206652213130 is a deficient number, since it is larger than the sum of its proper divisors (12965321770522).
16206652213130 is a wasteful number, since it uses less digits than its factorization.
16206652213130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1620665221320.
The product of its (nonzero) digits is 77760, while the sum is 38.
Adding to 16206652213130 its reverse (3131225660261), we get a palindrome (19337877873391).
The spelling of 16206652213130 in words is "sixteen trillion, two hundred six billion, six hundred fifty-two million, two hundred thirteen thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •