Base | Representation |
---|---|
bin | 111110101110110… |
… | …010110010101111 |
3 | 2201100101012120010 |
4 | 332232302302233 |
5 | 4123412012223 |
6 | 252233424303 |
7 | 35036466123 |
oct | 7656626257 |
9 | 2640335503 |
10 | 1052454063 |
11 | 4a00a0351 |
12 | 25456b093 |
13 | 13a0745ab |
14 | 9dac3583 |
15 | 625e3393 |
hex | 3ebb2caf |
1052454063 has 8 divisors (see below), whose sum is σ = 1403714176. Its totient is φ = 701415000.
The previous prime is 1052454059. The next prime is 1052454119. The reversal of 1052454063 is 3604542501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1052454063 - 22 = 1052454059 is a prime.
It is a super-2 number, since 2×10524540632 = 2215319109450415938, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1052454063.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1052454043) 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, 43813 + ... + 63438.
It is an arithmetic number, because the mean of its divisors is an integer number (175464272).
Almost surely, 21052454063 is an apocalyptic number.
1052454063 is a deficient number, since it is larger than the sum of its proper divisors (351260113).
1052454063 is a wasteful number, since it uses less digits than its factorization.
1052454063 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 110525.
The product of its (nonzero) digits is 14400, while the sum is 30.
The square root of 1052454063 is about 32441.5484063261. The cubic root of 1052454063 is about 1017.1875822063.
Adding to 1052454063 its reverse (3604542501), we get a palindrome (4656996564).
The spelling of 1052454063 in words is "one billion, fifty-two million, four hundred fifty-four thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •