Base | Representation |
---|---|
bin | 1000000111111001… |
… | …10111010111000100 |
3 | 102020221110200020112 |
4 | 10003330313113010 |
5 | 32412440114330 |
6 | 2000432452152 |
7 | 213035023142 |
oct | 40374672704 |
9 | 12227420215 |
10 | 4361254340 |
11 | 19388a5a33 |
12 | a186aa058 |
13 | 546718391 |
14 | 2d5310592 |
15 | 1a7d33795 |
hex | 103f375c4 |
4361254340 has 24 divisors (see below), whose sum is σ = 9163233240. Its totient is φ = 1743625728.
The previous prime is 4361254333. The next prime is 4361254367. The reversal of 4361254340 is 434521634.
It can be written as a sum of positive squares in 4 ways, for example, as 896283844 + 3464970496 = 29938^2 + 58864^2 .
It is a junction number, because it is equal to n+sod(n) for n = 4361254297 and 4361254306.
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 7 ways as a sum of consecutive naturals, for example, 13157 + ... + 94316.
It is an arithmetic number, because the mean of its divisors is an integer number (381801385).
Almost surely, 24361254340 is an apocalyptic number.
It is an amenable number.
4361254340 is an abundant number, since it is smaller than the sum of its proper divisors (4801978900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4361254340 is a wasteful number, since it uses less digits than its factorization.
4361254340 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109511 (or 109509 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 32.
The square root of 4361254340 is about 66039.7936096109. The cubic root of 4361254340 is about 1633.8184832126.
Adding to 4361254340 its reverse (434521634), we get a palindrome (4795775974).
The spelling of 4361254340 in words is "four billion, three hundred sixty-one million, two hundred fifty-four thousand, three hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •