Base | Representation |
---|---|
bin | 11110100111100010111… |
… | …00001010110100101001 |
3 | 10201120110021100002120221 |
4 | 33103301130022310221 |
5 | 114214020303314031 |
6 | 2123143105450041 |
7 | 136002050344054 |
oct | 17236134126451 |
9 | 3646407302527 |
10 | 1052022713641 |
11 | 376184439709 |
12 | 14ba80340921 |
13 | 78289106233 |
14 | 38cbd665a9b |
15 | 1c5739a8a11 |
hex | f4f170ad29 |
1052022713641 has 4 divisors (see below), whose sum is σ = 1053648715392. Its totient is φ = 1050396711892.
The previous prime is 1052022713617. The next prime is 1052022713659. The reversal of 1052022713641 is 1463172202501.
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 1052022713641 - 29 = 1052022713129 is a prime.
It is a super-2 number, since 2×10520227136412 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1052022713597 and 1052022713606.
It is not an unprimeable number, because it can be changed into a prime (1052022713141) 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, 812999905 + ... + 813001198.
It is an arithmetic number, because the mean of its divisors is an integer number (263412178848).
Almost surely, 21052022713641 is an apocalyptic number.
It is an amenable number.
1052022713641 is a deficient number, since it is larger than the sum of its proper divisors (1626001751).
1052022713641 is an equidigital number, since it uses as much as digits as its factorization.
1052022713641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1626001750.
The product of its (nonzero) digits is 20160, while the sum is 34.
The spelling of 1052022713641 in words is "one trillion, fifty-two billion, twenty-two million, seven hundred thirteen thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •