Base | Representation |
---|---|
bin | 11110101001001101001… |
… | …11000100001010010111 |
3 | 10201122202102212212102112 |
4 | 33110212213010022113 |
5 | 114222332134344031 |
6 | 2123411413301235 |
7 | 136033131545222 |
oct | 17244647041227 |
9 | 3648672785375 |
10 | 1052914762391 |
11 | 3765a1a30088 |
12 | 15008b03481b |
13 | 7839bb7772b |
14 | 38d65d125b9 |
15 | 1c5c6e6462b |
hex | f5269c4297 |
1052914762391 has 8 divisors (see below), whose sum is σ = 1075922420160. Its totient is φ = 1029932322048.
The previous prime is 1052914762387. The next prime is 1052914762397. The reversal of 1052914762391 is 1932674192501.
1052914762391 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1052914762391 - 22 = 1052914762387 is a prime.
It is a super-2 number, since 2×10529147623912 (a number of 25 digits) 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 (1052914762397) 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, 6219926 + ... + 6386963.
It is an arithmetic number, because the mean of its divisors is an integer number (134490302520).
Almost surely, 21052914762391 is an apocalyptic number.
1052914762391 is a deficient number, since it is larger than the sum of its proper divisors (23007657769).
1052914762391 is a wasteful number, since it uses less digits than its factorization.
1052914762391 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12608713.
The product of its (nonzero) digits is 816480, while the sum is 50.
The spelling of 1052914762391 in words is "one trillion, fifty-two billion, nine hundred fourteen million, seven hundred sixty-two thousand, three hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •