Base | Representation |
---|---|
bin | 1010000111111100… |
… | …00011000000110000 |
3 | 112000210111011011211 |
4 | 11003332003000300 |
5 | 42112414243112 |
6 | 2255201245504 |
7 | 251456224162 |
oct | 50376030060 |
9 | 15023434154 |
10 | 5435306032 |
11 | 233a0a7962 |
12 | 1078333894 |
13 | 6880b2320 |
14 | 397c16932 |
15 | 21c2910a7 |
hex | 143f83030 |
5435306032 has 40 divisors (see below), whose sum is σ = 11554979184. Its totient is φ = 2461265664.
The previous prime is 5435305969. The next prime is 5435306033. The reversal of 5435306032 is 2306035345.
It is a happy number.
It is a super-2 number, since 2×54353060322 = 59085103322991170048, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5435305985 and 5435306003.
It is not an unprimeable number, because it can be changed into a prime (5435306033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 235498 + ... + 257545.
Almost surely, 25435306032 is an apocalyptic number.
5435306032 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
5435306032 is an abundant number, since it is smaller than the sum of its proper divisors (6119673152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5435306032 is a wasteful number, since it uses less digits than its factorization.
5435306032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 493117 (or 493111 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 31.
The square root of 5435306032 is about 73724.5280215479. The cubic root of 5435306032 is about 1758.2258758067.
The spelling of 5435306032 in words is "five billion, four hundred thirty-five million, three hundred six thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •