Base | Representation |
---|---|
bin | 11100011000000010… |
… | …00110100111111000 |
3 | 1110022200110110021002 |
4 | 32030001012213320 |
5 | 222144401021100 |
6 | 10555353304132 |
7 | 1046340606152 |
oct | 161401064770 |
9 | 43280413232 |
10 | 15234001400 |
11 | 6508218802 |
12 | 2b51a05048 |
13 | 158a179717 |
14 | a47337ad2 |
15 | 5e26382d5 |
hex | 38c0469f8 |
15234001400 has 96 divisors (see below), whose sum is σ = 37077626880. Its totient is φ = 5813808000.
The previous prime is 15234001361. The next prime is 15234001421. The reversal of 15234001400 is 410043251.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 422897 + ... + 457503.
It is an arithmetic number, because the mean of its divisors is an integer number (386225280).
Almost surely, 215234001400 is an apocalyptic number.
15234001400 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 15234001400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18538813440).
15234001400 is an abundant number, since it is smaller than the sum of its proper divisors (21843625480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15234001400 is a wasteful number, since it uses less digits than its factorization.
15234001400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34725 (or 34716 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 20.
Adding to 15234001400 its reverse (410043251), we get a palindrome (15644044651).
The spelling of 15234001400 in words is "fifteen billion, two hundred thirty-four million, one thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •