Base | Representation |
---|---|
bin | 11111011111110011011… |
… | …010011100101001010100 |
3 | 21122220211101221122002110 |
4 | 133133303122130221110 |
5 | 240430244300041302 |
6 | 4334200301311020 |
7 | 312243101246124 |
oct | 37376332345124 |
9 | 7586741848073 |
10 | 2164452346452 |
11 | 764a36a16810 |
12 | 2ab59a865470 |
13 | 129151061406 |
14 | 76a8d826c84 |
15 | 3b480793b6c |
hex | 1f7f369ca54 |
2164452346452 has 96 divisors (see below), whose sum is σ = 5621429568384. Its totient is φ = 642705408000.
The previous prime is 2164452346429. The next prime is 2164452346499. The reversal of 2164452346452 is 2546432544612.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 456348 + ... + 2130060.
It is an arithmetic number, because the mean of its divisors is an integer number (58556558004).
Almost surely, 22164452346452 is an apocalyptic number.
2164452346452 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2164452346452, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2810714784192).
2164452346452 is an abundant number, since it is smaller than the sum of its proper divisors (3456977221932).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2164452346452 is a wasteful number, since it uses less digits than its factorization.
2164452346452 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1673929 (or 1673927 counting only the distinct ones).
The product of its digits is 5529600, while the sum is 48.
The spelling of 2164452346452 in words is "two trillion, one hundred sixty-four billion, four hundred fifty-two million, three hundred forty-six thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •