Base | Representation |
---|---|
bin | 11110101000100111101… |
… | …00011001011000101101 |
3 | 10201121221110122101010202 |
4 | 33110103310121120231 |
5 | 114221210432140333 |
6 | 2123320232043245 |
7 | 136022253020054 |
oct | 17242364313055 |
9 | 3647843571122 |
10 | 1052599490093 |
11 | 37644aa75368 |
12 | 150001533525 |
13 | 7834b760388 |
14 | 38d360c539b |
15 | 1c5a943a5e8 |
hex | f513d1962d |
1052599490093 has 8 divisors (see below), whose sum is σ = 1057269813312. Its totient is φ = 1047929459616.
The previous prime is 1052599490069. The next prime is 1052599490119. The reversal of 1052599490093 is 3900949952501.
It is a happy number.
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 1052599490093 - 212 = 1052599485997 is a prime.
It is a super-2 number, since 2×10525994900932 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1052599495093) 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, 10520921 + ... + 10620497.
It is an arithmetic number, because the mean of its divisors is an integer number (132158726664).
Almost surely, 21052599490093 is an apocalyptic number.
It is an amenable number.
1052599490093 is a deficient number, since it is larger than the sum of its proper divisors (4670323219).
1052599490093 is an equidigital number, since it uses as much as digits as its factorization.
1052599490093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 146371.
The product of its (nonzero) digits is 3936600, while the sum is 56.
The spelling of 1052599490093 in words is "one trillion, fifty-two billion, five hundred ninety-nine million, four hundred ninety thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •