Base | Representation |
---|---|
bin | 1010010010001101… |
… | …01010100110100110 |
3 | 112020210120210110010 |
4 | 11021012222212212 |
5 | 42301442421210 |
6 | 2311515511050 |
7 | 253553364015 |
oct | 51106524646 |
9 | 15223523403 |
10 | 5521451430 |
11 | 2383796200 |
12 | 10a1158486 |
13 | 69cbb4931 |
14 | 3a543ca7c |
15 | 224b0a920 |
hex | 1491aa9a6 |
5521451430 has 96 divisors (see below), whose sum is σ = 14876047872. Its totient is φ = 1310013760.
The previous prime is 5521451387. The next prime is 5521451459. The reversal of 5521451430 is 341541255.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a Curzon number.
It is a congruent 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, 154429 + ... + 186791.
It is an arithmetic number, because the mean of its divisors is an integer number (154958832).
Almost surely, 25521451430 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5521451430, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7438023936).
5521451430 is an abundant number, since it is smaller than the sum of its proper divisors (9354596442).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5521451430 is a wasteful number, since it uses less digits than its factorization.
5521451430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32442 (or 32431 counting only the distinct ones).
The product of its (nonzero) digits is 12000, while the sum is 30.
The square root of 5521451430 is about 74306.4696375760. The cubic root of 5521451430 is about 1767.4660699687.
Adding to 5521451430 its reverse (341541255), we get a palindrome (5862992685).
The spelling of 5521451430 in words is "five billion, five hundred twenty-one million, four hundred fifty-one thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •