Base | Representation |
---|---|
bin | 1010001001101110… |
… | …10111010001100011 |
3 | 112001211202111212211 |
4 | 11010313113101203 |
5 | 42130241044420 |
6 | 2300455302551 |
7 | 252031023346 |
oct | 50467272143 |
9 | 15054674784 |
10 | 5450331235 |
11 | 234762a588 |
12 | 108137aa57 |
13 | 68b24328b |
14 | 399c0845d |
15 | 21d75ce5a |
hex | 144dd7463 |
5450331235 has 8 divisors (see below), whose sum is σ = 6550510176. Its totient is φ = 4353523200.
The previous prime is 5450331221. The next prime is 5450331239. The reversal of 5450331235 is 5321330545.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5450331235 - 227 = 5316113507 is a prime.
It is a super-2 number, since 2×54503312352 = 59412221142433250450, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5450331197 and 5450331206.
It is not an unprimeable number, because it can be changed into a prime (5450331239) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 839166 + ... + 845635.
It is an arithmetic number, because the mean of its divisors is an integer number (818813772).
Almost surely, 25450331235 is an apocalyptic number.
5450331235 is a deficient number, since it is larger than the sum of its proper divisors (1100178941).
5450331235 is a wasteful number, since it uses less digits than its factorization.
5450331235 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1685453.
The product of its (nonzero) digits is 27000, while the sum is 31.
The square root of 5450331235 is about 73826.3586735795. The cubic root of 5450331235 is about 1759.8445148240.
The spelling of 5450331235 in words is "five billion, four hundred fifty million, three hundred thirty-one thousand, two hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •