Base | Representation |
---|---|
bin | 1101001010001100110… |
… | …00100111011001110100 |
3 | 1121020002021120000100000 |
4 | 12211012120213121310 |
5 | 24402002010032202 |
6 | 543414351351300 |
7 | 44444521122360 |
oct | 6450630473164 |
9 | 1536067500300 |
10 | 452152424052 |
11 | 16483628a4aa |
12 | 73768b22530 |
13 | 3383a2c2764 |
14 | 17c547082a0 |
15 | bb6520d91c |
hex | 6946627674 |
452152424052 has 72 divisors (see below), whose sum is σ = 1354596582976. Its totient is φ = 129186404928.
The previous prime is 452152424047. The next prime is 452152424083. The reversal of 452152424052 is 250424251254.
452152424052 is a `hidden beast` number, since 4 + 5 + 2 + 1 + 5 + 242 + 405 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 452152423998 and 452152424016.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 33220153 + ... + 33233760.
Almost surely, 2452152424052 is an apocalyptic number.
452152424052 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
452152424052 is an abundant number, since it is smaller than the sum of its proper divisors (902444158924).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
452152424052 is a wasteful number, since it uses less digits than its factorization.
452152424052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66453939 (or 66453925 counting only the distinct ones).
The product of its (nonzero) digits is 128000, while the sum is 36.
The spelling of 452152424052 in words is "four hundred fifty-two billion, one hundred fifty-two million, four hundred twenty-four thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •