Base | Representation |
---|---|
bin | 11100001010101000… |
… | …011011110101011000 |
3 | 2220001200210211212102 |
4 | 130022220123311120 |
5 | 443414221034000 |
6 | 21520555302532 |
7 | 2120311321400 |
oct | 341250336530 |
9 | 86050724772 |
10 | 30243143000 |
11 | 1190a513a64 |
12 | 5a4044aa48 |
13 | 2b0c8766b5 |
14 | 166c85b800 |
15 | bc01563d5 |
hex | 70aa1bd58 |
30243143000 has 192 divisors, whose sum is σ = 85165797600. Its totient is φ = 10011052800.
The previous prime is 30243142927. The next prime is 30243143009. The reversal of 30243143000 is 34134203.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30243143009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1410359 + ... + 1431641.
Almost surely, 230243143000 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 30243143000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (42582898800).
30243143000 is an abundant number, since it is smaller than the sum of its proper divisors (54922654600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30243143000 is a wasteful number, since it uses less digits than its factorization.
30243143000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21347 (or 21326 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 20.
Adding to 30243143000 its reverse (34134203), we get a palindrome (30277277203).
The spelling of 30243143000 in words is "thirty billion, two hundred forty-three million, one hundred forty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •