Base | Representation |
---|---|
bin | 11100110010011… |
… | …111111011000000 |
3 | 1020122211221102220 |
4 | 130302133323000 |
5 | 1442122000000 |
6 | 115532211040 |
7 | 14653301160 |
oct | 3462377300 |
9 | 1218757386 |
10 | 483000000 |
11 | 22870605a |
12 | 115909a80 |
13 | 790b2322 |
14 | 4820c5a0 |
15 | 2c60b1a0 |
hex | 1cc9fec0 |
483000000 has 392 divisors, whose sum is σ = 1904975616. Its totient is φ = 105600000.
The previous prime is 482999989. The next prime is 483000029. The reversal of 483000000 is 384.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 20999989 + ... + 21000011.
Almost surely, 2483000000 is an apocalyptic number.
483000000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 483000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (952487808).
483000000 is an abundant number, since it is smaller than the sum of its proper divisors (1421975616).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
483000000 is an frugal number, since it uses more digits than its factorization.
483000000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 75 (or 40 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 15.
The square root of 483000000 is about 21977.2609758359. The cubic root of 483000000 is about 784.6013365124.
Adding to 483000000 its reverse (384), we get a palindrome (483000384).
It can be divided in two parts, 48 and 3000000, that multiplied together give a square (144000000 = 120002).
The spelling of 483000000 in words is "four hundred eighty-three million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •