Base | Representation |
---|---|
bin | 11110101000001000111… |
… | …10011001010100111101 |
3 | 10201121021112020210112111 |
4 | 33110010132121110331 |
5 | 114220144032030240 |
6 | 2123234514334021 |
7 | 136013005650010 |
oct | 17240436312475 |
9 | 3647245223474 |
10 | 1052342064445 |
11 | 37632872a6a1 |
12 | 14bb4b28a311 |
13 | 7830a31aac9 |
14 | 38d0dc35377 |
15 | 1c591a3b1ea |
hex | f50479953d |
1052342064445 has 8 divisors (see below), whose sum is σ = 1443211974144. Its totient is φ = 721605987024.
The previous prime is 1052342064419. The next prime is 1052342064463. The reversal of 1052342064445 is 5444602432501.
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 1052342064445 - 235 = 1017982326077 is a prime.
It is a super-2 number, since 2×10523420644452 (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 = 1052342064398 and 1052342064407.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15033458029 + ... + 15033458098.
It is an arithmetic number, because the mean of its divisors is an integer number (180401496768).
Almost surely, 21052342064445 is an apocalyptic number.
It is an amenable number.
1052342064445 is a deficient number, since it is larger than the sum of its proper divisors (390869909699).
1052342064445 is an equidigital number, since it uses as much as digits as its factorization.
1052342064445 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30066916139.
The product of its (nonzero) digits is 460800, while the sum is 40.
Adding to 1052342064445 its reverse (5444602432501), we get a palindrome (6496944496946).
The spelling of 1052342064445 in words is "one trillion, fifty-two billion, three hundred forty-two million, sixty-four thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •