Base | Representation |
---|---|
bin | 11011001111010… |
… | …10001111010001 |
3 | 120220222000200000 |
4 | 31213222033101 |
5 | 431444003213 |
6 | 34401320213 |
7 | 5443136010 |
oct | 1547521721 |
9 | 526860600 |
10 | 228500433 |
11 | 107a89837 |
12 | 64636069 |
13 | 38455875 |
14 | 224c0a77 |
15 | 150d8c73 |
hex | d9ea3d1 |
228500433 has 24 divisors (see below), whose sum is σ = 391180608. Its totient is φ = 130570704.
The previous prime is 228500413. The next prime is 228500471. The reversal of 228500433 is 334005822.
228500433 is a `hidden beast` number, since 228 + 5 + 0 + 0 + 433 = 666.
It is not a de Polignac number, because 228500433 - 26 = 228500369 is a prime.
It is a hoax number, since the sum of its digits (27) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 228500397 and 228500406.
It is not an unprimeable number, because it can be changed into a prime (228500413) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 65466 + ... + 68867.
It is an arithmetic number, because the mean of its divisors is an integer number (16299192).
Almost surely, 2228500433 is an apocalyptic number.
It is an amenable number.
228500433 is a deficient number, since it is larger than the sum of its proper divisors (162680175).
228500433 is an equidigital number, since it uses as much as digits as its factorization.
228500433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 134355 (or 134343 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 27.
The square root of 228500433 is about 15116.2307801912. The cubic root of 228500433 is about 611.3581072666.
The spelling of 228500433 in words is "two hundred twenty-eight million, five hundred thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •