Base | Representation |
---|---|
bin | 1001111100100110… |
… | …00100110010001111 |
3 | 111210011102222112101 |
4 | 10332103010302033 |
5 | 41414034430043 |
6 | 2241522015531 |
7 | 246222366040 |
oct | 47623046217 |
9 | 14704388471 |
10 | 5340155023 |
11 | 22a0418565 |
12 | 10504a75a7 |
13 | 671478958 |
14 | 3893288c7 |
15 | 213c4824d |
hex | 13e4c4c8f |
5340155023 has 8 divisors (see below), whose sum is σ = 6103864448. Its totient is φ = 4576653144.
The previous prime is 5340154997. The next prime is 5340155047. The reversal of 5340155023 is 3205510435.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5340155023 - 217 = 5340023951 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5340154982 and 5340155000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5340155053) 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, 7840 + ... + 103642.
It is an arithmetic number, because the mean of its divisors is an integer number (762983056).
Almost surely, 25340155023 is an apocalyptic number.
5340155023 is a deficient number, since it is larger than the sum of its proper divisors (763709425).
5340155023 is an equidigital number, since it uses as much as digits as its factorization.
5340155023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103773.
The product of its (nonzero) digits is 9000, while the sum is 28.
The square root of 5340155023 is about 73076.3643252728. The cubic root of 5340155023 is about 1747.9055239544.
Adding to 5340155023 its reverse (3205510435), we get a palindrome (8545665458).
The spelling of 5340155023 in words is "five billion, three hundred forty million, one hundred fifty-five thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •