Base | Representation |
---|---|
bin | 1110111101101001011000… |
… | …0011100111111110001000 |
3 | 2011020211010001101210002010 |
4 | 3233122112003213332020 |
5 | 4124023143010314412 |
6 | 54554020013335520 |
7 | 3315430620646650 |
oct | 357322603477610 |
9 | 64224101353063 |
10 | 16452242276232 |
11 | 52733a1946174 |
12 | 1a1867a7975a0 |
13 | 9245942aa629 |
14 | 40c415535360 |
15 | 1d7e61e3733c |
hex | ef6960e7f88 |
16452242276232 has 32 divisors (see below), whose sum is σ = 47006406504000. Its totient is φ = 4700640650304.
The previous prime is 16452242276231. The next prime is 16452242276233. The reversal of 16452242276232 is 23267224225461.
It is an interprime number because it is at equal distance from previous prime (16452242276231) and next prime (16452242276233).
It is not an unprimeable number, because it can be changed into a prime (16452242276231) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 48965006607 + ... + 48965006942.
It is an arithmetic number, because the mean of its divisors is an integer number (1468950203250).
Almost surely, 216452242276232 is an apocalyptic number.
16452242276232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
16452242276232 is an abundant number, since it is smaller than the sum of its proper divisors (30554164227768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16452242276232 is a wasteful number, since it uses less digits than its factorization.
16452242276232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97930013565 (or 97930013561 counting only the distinct ones).
The product of its digits is 3870720, while the sum is 48.
The spelling of 16452242276232 in words is "sixteen trillion, four hundred fifty-two billion, two hundred forty-two million, two hundred seventy-six thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •