Base | Representation |
---|---|
bin | 1000100101000010001… |
… | …1111011010010000000 |
3 | 112002102012101021100211 |
4 | 2021100203323102000 |
5 | 4403313400430300 |
6 | 151412231123504 |
7 | 13435140303016 |
oct | 2112043732200 |
9 | 462365337324 |
10 | 147380483200 |
11 | 5755a493435 |
12 | 24691513594 |
13 | 10b89965012 |
14 | 71c190c8b6 |
15 | 3c78b464ba |
hex | 22508fb480 |
147380483200 has 96 divisors (see below), whose sum is σ = 364600765620. Its totient is φ = 58867200000.
The previous prime is 147380483143. The next prime is 147380483221. The reversal of 147380483200 is 2384083741.
It can be written as a sum of positive squares in 6 ways, for example, as 121376985664 + 26003497536 = 348392^2 + 161256^2 .
It is a Harshad number since it is a multiple of its sum of digits (40).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2210350 + ... + 2276050.
Almost surely, 2147380483200 is an apocalyptic number.
147380483200 is a gapful number since it is divisible by the number (10) 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 147380483200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (182300382810).
147380483200 is an abundant number, since it is smaller than the sum of its proper divisors (217220282420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
147380483200 is an equidigital number, since it uses as much as digits as its factorization.
147380483200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 66426 (or 66409 counting only the distinct ones).
The product of its (nonzero) digits is 129024, while the sum is 40.
The spelling of 147380483200 in words is "one hundred forty-seven billion, three hundred eighty million, four hundred eighty-three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •