Base | Representation |
---|---|
bin | 10100011001011011111… |
… | …010000000010010001001 |
3 | 11222000000222020022002111 |
4 | 110121123322000102021 |
5 | 140431141011130130 |
6 | 2551533242502321 |
7 | 203161315133563 |
oct | 24313372002211 |
9 | 4860028208074 |
10 | 1401701270665 |
11 | 4a0504909103 |
12 | 1a77aab049a1 |
13 | a22452098c7 |
14 | 4bbb2542333 |
15 | 266dc6b502a |
hex | 1465be80489 |
1401701270665 has 8 divisors (see below), whose sum is σ = 1697473099080. Its totient is φ = 1111073300352.
The previous prime is 1401701270663. The next prime is 1401701270687. The reversal of 1401701270665 is 5660721071041.
It can be written as a sum of positive squares in 4 ways, for example, as 547919726656 + 853781544009 = 740216^2 + 924003^2 .
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 1401701270665 - 21 = 1401701270663 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1401701270663) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1285963924 + ... + 1285965013.
It is an arithmetic number, because the mean of its divisors is an integer number (212184137385).
Almost surely, 21401701270665 is an apocalyptic number.
It is an amenable number.
1401701270665 is a deficient number, since it is larger than the sum of its proper divisors (295771828415).
1401701270665 is a wasteful number, since it uses less digits than its factorization.
1401701270665 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2571929051.
The product of its (nonzero) digits is 70560, while the sum is 40.
The spelling of 1401701270665 in words is "one trillion, four hundred one billion, seven hundred one million, two hundred seventy thousand, six hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •