Base | Representation |
---|---|
bin | 111110101101101… |
… | …000111000101101 |
3 | 2201022210211022012 |
4 | 332231220320231 |
5 | 4123322320331 |
6 | 252223131005 |
7 | 35034065423 |
oct | 7655507055 |
9 | 2638724265 |
10 | 1052151341 |
11 | 49aa0396a |
12 | 254443a65 |
13 | 139c99877 |
14 | 9da45113 |
15 | 6258382b |
hex | 3eb68e2d |
1052151341 has 4 divisors (see below), whose sum is σ = 1053885312. Its totient is φ = 1050417372.
The previous prime is 1052151329. The next prime is 1052151383. The reversal of 1052151341 is 1431512501.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1052151341 - 214 = 1052134957 is a prime.
It is a super-2 number, since 2×10521513412 = 2214044888736196562, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1052151041) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 866075 + ... + 867288.
It is an arithmetic number, because the mean of its divisors is an integer number (263471328).
Almost surely, 21052151341 is an apocalyptic number.
It is an amenable number.
1052151341 is a deficient number, since it is larger than the sum of its proper divisors (1733971).
1052151341 is an equidigital number, since it uses as much as digits as its factorization.
1052151341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1733970.
The product of its (nonzero) digits is 600, while the sum is 23.
The square root of 1052151341 is about 32436.8824180130. The cubic root of 1052151341 is about 1017.0900468052.
Adding to 1052151341 its reverse (1431512501), we get a palindrome (2483663842).
The spelling of 1052151341 in words is "one billion, fifty-two million, one hundred fifty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •