Base | Representation |
---|---|
bin | 1101100111111101101… |
… | …10100000100111100101 |
3 | 1122202022221021020002102 |
4 | 12303332312200213211 |
5 | 30132213313421323 |
6 | 555020145021445 |
7 | 45551515535531 |
oct | 6637666404745 |
9 | 1582287236072 |
10 | 468132170213 |
11 | 170596451294 |
12 | 76888624885 |
13 | 351b5b06b66 |
14 | 1892cac6bc1 |
15 | c29d053328 |
hex | 6cfeda09e5 |
468132170213 has 4 divisors (see below), whose sum is σ = 468256644108. Its totient is φ = 468007696320.
The previous prime is 468132170179. The next prime is 468132170257. The reversal of 468132170213 is 312071231864.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 113031784804 + 355100385409 = 336202^2 + 595903^2 .
It is a cyclic number.
It is not a de Polignac number, because 468132170213 - 216 = 468132104677 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (468132170273) 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 in 3 ways as a sum of consecutive naturals, for example, 62231306 + ... + 62238827.
It is an arithmetic number, because the mean of its divisors is an integer number (117064161027).
Almost surely, 2468132170213 is an apocalyptic number.
It is an amenable number.
468132170213 is a deficient number, since it is larger than the sum of its proper divisors (124473895).
468132170213 is a wasteful number, since it uses less digits than its factorization.
468132170213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124473894.
The product of its (nonzero) digits is 48384, while the sum is 38.
The spelling of 468132170213 in words is "four hundred sixty-eight billion, one hundred thirty-two million, one hundred seventy thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.131 sec. • engine limits •