Base | Representation |
---|---|
bin | 111110110101001… |
… | …100000010111101 |
3 | 2201110112101000101 |
4 | 332311030002331 |
5 | 4124324132430 |
6 | 252333401101 |
7 | 35056650241 |
oct | 7665140275 |
9 | 2643471011 |
10 | 1054130365 |
11 | 4a1035822 |
12 | 255039191 |
13 | 13a5105a2 |
14 | 9dddc421 |
15 | 62824dca |
hex | 3ed4c0bd |
1054130365 has 24 divisors (see below), whose sum is σ = 1327266360. Its totient is φ = 803641344.
The previous prime is 1054130327. The next prime is 1054130381. The reversal of 1054130365 is 5630314501.
It can be written as a sum of positive squares in 4 ways, for example, as 933156 + 1053197209 = 966^2 + 32453^2 .
It is a de Polignac number, because none of the positive numbers 2k-1054130365 is a prime.
It is a super-2 number, since 2×10541303652 = 2222381652830066450, which contains 22 as substring.
It is a congruent 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 23 ways as a sum of consecutive naturals, for example, 933121 + ... + 934249.
It is an arithmetic number, because the mean of its divisors is an integer number (55302765).
Almost surely, 21054130365 is an apocalyptic number.
It is an amenable number.
1054130365 is a deficient number, since it is larger than the sum of its proper divisors (273135995).
1054130365 is a wasteful number, since it uses less digits than its factorization.
1054130365 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1533 (or 1510 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 28.
The square root of 1054130365 is about 32467.3738543788. The cubic root of 1054130365 is about 1017.7273394467.
Adding to 1054130365 its reverse (5630314501), we get a palindrome (6684444866).
The spelling of 1054130365 in words is "one billion, fifty-four million, one hundred thirty thousand, three hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •