Base | Representation |
---|---|
bin | 1001111011100001… |
… | …00100111000011010 |
3 | 111202112102112002020 |
4 | 10331300210320122 |
5 | 41404231031300 |
6 | 2241000115310 |
7 | 246052461660 |
oct | 47560447032 |
9 | 14675375066 |
10 | 5331111450 |
11 | 2296300a35 |
12 | 1049465b36 |
13 | 66c630522 |
14 | 388052c30 |
15 | 21305d8a0 |
hex | 13dc24e1a |
5331111450 has 48 divisors (see below), whose sum is σ = 15109896000. Its totient is φ = 1218539520.
The previous prime is 5331111437. The next prime is 5331111479. The reversal of 5331111450 is 541111335.
It is a super-2 number, since 2×53311114502 = 56841498584642205000, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5331111450.
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, 2537575 + ... + 2539674.
It is an arithmetic number, because the mean of its divisors is an integer number (314789500).
Almost surely, 25331111450 is an apocalyptic number.
5331111450 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5331111450 is an abundant number, since it is smaller than the sum of its proper divisors (9778784550).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5331111450 is a wasteful number, since it uses less digits than its factorization.
5331111450 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5077271 (or 5077266 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 24.
The square root of 5331111450 is about 73014.4605540574. The cubic root of 5331111450 is about 1746.9182715378.
Adding to 5331111450 its reverse (541111335), we get a palindrome (5872222785).
The spelling of 5331111450 in words is "five billion, three hundred thirty-one million, one hundred eleven thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •