Base | Representation |
---|---|
bin | 1001100100110010… |
… | …10001011101110011 |
3 | 111021020200002011212 |
4 | 10302121101131303 |
5 | 41011424000420 |
6 | 2210025430335 |
7 | 241246063061 |
oct | 46231213563 |
9 | 14236602155 |
10 | 5140453235 |
11 | 21a8719665 |
12 | bb563b3ab |
13 | 63bc97308 |
14 | 36a9c3031 |
15 | 20144c3c5 |
hex | 132651773 |
5140453235 has 4 divisors (see below), whose sum is σ = 6168543888. Its totient is φ = 4112362584.
The previous prime is 5140453207. The next prime is 5140453247. The reversal of 5140453235 is 5323540415.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 5323540415 = 5 ⋅1064708083.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5140453235 is a prime.
It is a super-2 number, since 2×51404532352 = 52848518922443930450, which contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 514045319 + ... + 514045328.
It is an arithmetic number, because the mean of its divisors is an integer number (1542135972).
Almost surely, 25140453235 is an apocalyptic number.
5140453235 is a deficient number, since it is larger than the sum of its proper divisors (1028090653).
5140453235 is a wasteful number, since it uses less digits than its factorization.
5140453235 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1028090652.
The product of its (nonzero) digits is 36000, while the sum is 32.
The square root of 5140453235 is about 71696.9541542735. The cubic root of 5140453235 is about 1725.8397630736.
The spelling of 5140453235 in words is "five billion, one hundred forty million, four hundred fifty-three thousand, two hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •