Base | Representation |
---|---|
bin | 1010010110001000… |
… | …11110000010110011 |
3 | 112100002122021201111 |
4 | 11023010132002303 |
5 | 42333413231011 |
6 | 2315054414151 |
7 | 254433606565 |
oct | 51304360263 |
9 | 15302567644 |
10 | 5554430131 |
11 | 23a0370628 |
12 | 10b0201357 |
13 | 6a6990663 |
14 | 3a9985335 |
15 | 227972121 |
hex | 14b11e0b3 |
5554430131 has 8 divisors (see below), whose sum is σ = 5607080640. Its totient is φ = 5501961192.
The previous prime is 5554430093. The next prime is 5554430143. The reversal of 5554430131 is 1310344555.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5554430131 - 211 = 5554428083 is a prime.
It is a super-2 number, since 2×55544301312 = 61703388160321354322, 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 = 5554430093 and 5554430102.
It is not an unprimeable number, because it can be changed into a prime (5554430191) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16476 + ... + 106678.
It is an arithmetic number, because the mean of its divisors is an integer number (700885080).
Almost surely, 25554430131 is an apocalyptic number.
5554430131 is a deficient number, since it is larger than the sum of its proper divisors (52650509).
5554430131 is a wasteful number, since it uses less digits than its factorization.
5554430131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90785.
The product of its (nonzero) digits is 18000, while the sum is 31.
The square root of 5554430131 is about 74528.0492901834. The cubic root of 5554430131 is about 1770.9780130230.
Adding to 5554430131 its reverse (1310344555), we get a palindrome (6864774686).
The spelling of 5554430131 in words is "five billion, five hundred fifty-four million, four hundred thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •