Base | Representation |
---|---|
bin | 11011001000100… |
… | …001111100101000 |
3 | 1011201120121212020 |
4 | 123020201330220 |
5 | 1413014033112 |
6 | 113100544440 |
7 | 14165213010 |
oct | 3310417450 |
9 | 1151517766 |
10 | 455221032 |
11 | 213a62332 |
12 | 108552120 |
13 | 73407276 |
14 | 4465ac40 |
15 | 29e7048c |
hex | 1b221f28 |
455221032 has 64 divisors (see below), whose sum is σ = 1332374400. Its totient is φ = 126888960.
The previous prime is 455221001. The next prime is 455221051. The reversal of 455221032 is 230122554.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 455220993 and 455221011.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 26157 + ... + 39932.
It is an arithmetic number, because the mean of its divisors is an integer number (20818350).
Almost surely, 2455221032 is an apocalyptic number.
455221032 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
455221032 is an abundant number, since it is smaller than the sum of its proper divisors (877153368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
455221032 is a wasteful number, since it uses less digits than its factorization.
455221032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66146 (or 66142 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 24.
The square root of 455221032 is about 21335.9094486267. The cubic root of 455221032 is about 769.2616929373.
Adding to 455221032 its reverse (230122554), we get a palindrome (685343586).
The spelling of 455221032 in words is "four hundred fifty-five million, two hundred twenty-one thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •