Base | Representation |
---|---|
bin | 11111001001001100100… |
… | …01000101110111101001 |
3 | 10210022002100000000000000 |
4 | 33210212101011313221 |
5 | 120013020222341101 |
6 | 2135331514133213 |
7 | 140211541220664 |
oct | 17444621056751 |
9 | 3708070000000 |
10 | 1070088871401 |
11 | 3829052a8400 |
12 | 153482721209 |
13 | 79ba7c5b504 |
14 | 39b14b946db |
15 | 1cc7ea7e486 |
hex | f926445de9 |
1070088871401 has 135 divisors (see below), whose sum is σ = 1806304857357. Its totient is φ = 633456414360.
The previous prime is 1070088871393. The next prime is 1070088871427. The reversal of 1070088871401 is 1041788800701.
The square root of 1070088871401 is 1034451.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 1070088871401 - 23 = 1070088871393 is a prime.
It is a super-2 number, since 2×10700888714012 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1070088871471) by changing a digit.
It is a polite number, since it can be written in 134 ways as a sum of consecutive naturals, for example, 24885787686 + ... + 24885787728.
Almost surely, 21070088871401 is an apocalyptic number.
1070088871401 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1070088871401 is the 1034451-st square number.
1070088871401 is the 517226-th centered octagonal number.
It is an amenable number.
1070088871401 is a deficient number, since it is larger than the sum of its proper divisors (736215985956).
1070088871401 is an frugal number, since it uses more digits than its factorization.
1070088871401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150 (or 57 counting only the distinct ones).
The product of its (nonzero) digits is 100352, while the sum is 45.
The spelling of 1070088871401 in words is "one trillion, seventy billion, eighty-eight million, eight hundred seventy-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •