Base | Representation |
---|---|
bin | 1010001010000100… |
… | …10110010111100100 |
3 | 112002001011211022210 |
4 | 11011002112113210 |
5 | 42132010223413 |
6 | 2301041123420 |
7 | 252064346442 |
oct | 50502262744 |
9 | 15061154283 |
10 | 5453211108 |
11 | 2349217244 |
12 | 1082329570 |
13 | 68ba11047 |
14 | 39a357b92 |
15 | 21db2b3c3 |
hex | 1450965e4 |
5453211108 has 96 divisors (see below), whose sum is σ = 13869878400. Its totient is φ = 1660594176.
The previous prime is 5453211107. The next prime is 5453211119. The reversal of 5453211108 is 8011123545.
It is a super-2 number, since 2×54532111082 = 59475022776829175328, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5453211107) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5351023 + ... + 5352041.
It is an arithmetic number, because the mean of its divisors is an integer number (144477900).
Almost surely, 25453211108 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 5453211108, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6934939200).
5453211108 is an abundant number, since it is smaller than the sum of its proper divisors (8416667292).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5453211108 is a wasteful number, since it uses less digits than its factorization.
5453211108 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1789 (or 1787 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 30.
The square root of 5453211108 is about 73845.8604662441. The cubic root of 5453211108 is about 1760.1544186999.
The spelling of 5453211108 in words is "five billion, four hundred fifty-three million, two hundred eleven thousand, one hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •