Base | Representation |
---|---|
bin | 1110111101101001100111… |
… | …0011000110000111100100 |
3 | 2011020211021102112010102110 |
4 | 3233122121303012013210 |
5 | 4124023310043132012 |
6 | 54554030135041020 |
7 | 3315432312355035 |
oct | 357323163060744 |
9 | 64224242463373 |
10 | 16452305052132 |
11 | 5273424322684 |
12 | 1a18697810170 |
13 | 9245a42b9c31 |
14 | 40c41d9d6a8c |
15 | 1d7e676d773c |
hex | ef699cc61e4 |
16452305052132 has 24 divisors (see below), whose sum is σ = 38390686350016. Its totient is φ = 5483819603808.
The previous prime is 16452305052083. The next prime is 16452305052181. The reversal of 16452305052132 is 23125050325461.
It is an interprime number because it is at equal distance from previous prime (16452305052083) and next prime (16452305052181).
It is a super-3 number, since 3×164523050521323 (a number of 41 digits) contains 333 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 35016943 + ... + 35483670.
Almost surely, 216452305052132 is an apocalyptic number.
16452305052132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
16452305052132 is an abundant number, since it is smaller than the sum of its proper divisors (21938381297884).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16452305052132 is a wasteful number, since it uses less digits than its factorization.
16452305052132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 70520067 (or 70520065 counting only the distinct ones).
The product of its (nonzero) digits is 216000, while the sum is 39.
Adding to 16452305052132 its reverse (23125050325461), we get a palindrome (39577355377593).
The spelling of 16452305052132 in words is "sixteen trillion, four hundred fifty-two billion, three hundred five million, fifty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •