Base | Representation |
---|---|
bin | 11000101000011110111… |
… | …110001110001010100101 |
3 | 12222211020201211002102101 |
4 | 120220132332032022211 |
5 | 210213211101221203 |
6 | 3333344343012101 |
7 | 233203410622300 |
oct | 30503676161245 |
9 | 5884221732371 |
10 | 1692736742053 |
11 | 5a2981841375 |
12 | 23409213a031 |
13 | c3816a276c6 |
14 | 5bd00c63b37 |
15 | 2e072d5241d |
hex | 18a1ef8e2a5 |
1692736742053 has 6 divisors (see below), whose sum is σ = 1969101924486. Its totient is φ = 1450917207432.
The previous prime is 1692736742033. The next prime is 1692736742071. The reversal of 1692736742053 is 3502476372961.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 1317486161124 + 375250580929 = 1147818^2 + 612577^2 .
It is not a de Polignac number, because 1692736742053 - 233 = 1684146807461 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1692736741985 and 1692736742003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1692736742033) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 17272823850 + ... + 17272823947.
It is an arithmetic number, because the mean of its divisors is an integer number (328183654081).
Almost surely, 21692736742053 is an apocalyptic number.
It is an amenable number.
1692736742053 is a deficient number, since it is larger than the sum of its proper divisors (276365182433).
1692736742053 is an equidigital number, since it uses as much as digits as its factorization.
1692736742053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34545647811 (or 34545647804 counting only the distinct ones).
The product of its (nonzero) digits is 11430720, while the sum is 55.
The spelling of 1692736742053 in words is "one trillion, six hundred ninety-two billion, seven hundred thirty-six million, seven hundred forty-two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •