Base | Representation |
---|---|
bin | 10110100101011110100… |
… | …110110011111111110101 |
3 | 12111101011110022212201120 |
4 | 112211132212303333311 |
5 | 200412120012122423 |
6 | 3145002235414153 |
7 | 220063515644340 |
oct | 26453646637765 |
9 | 5441143285646 |
10 | 1552070426613 |
11 | 549258325613 |
12 | 2109752b4359 |
13 | b348a0bb425 |
14 | 55198d49457 |
15 | 2a58d8b3ee3 |
hex | 1695e9b3ff5 |
1552070426613 has 64 divisors (see below), whose sum is σ = 2508869376000. Its totient is φ = 833166028800.
The previous prime is 1552070426611. The next prime is 1552070426659. The reversal of 1552070426613 is 3166240702551.
It is not a de Polignac number, because 1552070426613 - 21 = 1552070426611 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1552070426611) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 728328558 + ... + 728330688.
It is an arithmetic number, because the mean of its divisors is an integer number (39201084000).
Almost surely, 21552070426613 is an apocalyptic number.
It is an amenable number.
1552070426613 is a deficient number, since it is larger than the sum of its proper divisors (956798949387).
1552070426613 is a wasteful number, since it uses less digits than its factorization.
1552070426613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5018.
The product of its (nonzero) digits is 302400, while the sum is 42.
The spelling of 1552070426613 in words is "one trillion, five hundred fifty-two billion, seventy million, four hundred twenty-six thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •