Base | Representation |
---|---|
bin | 11100101100000100… |
… | …00000100111111010 |
3 | 1110202101121020021200 |
4 | 32112002000213322 |
5 | 223020403324010 |
6 | 11024154315030 |
7 | 1053450635352 |
oct | 162602004772 |
9 | 43671536250 |
10 | 15402011130 |
11 | 6594040a20 |
12 | 2b9a128a76 |
13 | 15b5c12b6c |
14 | a6178db62 |
15 | 602273cc0 |
hex | 3960809fa |
15402011130 has 96 divisors (see below), whose sum is σ = 43749313920. Its totient is φ = 3728384640.
The previous prime is 15402011129. The next prime is 15402011147. The reversal of 15402011130 is 3111020451.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 690939 + ... + 712881.
It is an arithmetic number, because the mean of its divisors is an integer number (455722020).
Almost surely, 215402011130 is an apocalyptic number.
15402011130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 15402011130, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21874656960).
15402011130 is an abundant number, since it is smaller than the sum of its proper divisors (28347302790).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15402011130 is a wasteful number, since it uses less digits than its factorization.
15402011130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22676 (or 22673 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 18.
Adding to 15402011130 its reverse (3111020451), we get a palindrome (18513031581).
The spelling of 15402011130 in words is "fifteen billion, four hundred two million, eleven thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •