Base | Representation |
---|---|
bin | 100000101001100100… |
… | …0101110100110010001 |
3 | 20200222101101010220011 |
4 | 1001103020232212101 |
5 | 2122043223224211 |
6 | 52113212114521 |
7 | 5031332331034 |
oct | 1012310564621 |
9 | 220871333804 |
10 | 70114273681 |
11 | 2780a752631 |
12 | 11709165a41 |
13 | 67c501800a |
14 | 3571c8101b |
15 | 1c55684921 |
hex | 105322e991 |
70114273681 has 3 divisors (see below), whose sum is σ = 70114538473. Its totient is φ = 70114008890.
The previous prime is 70114273667. The next prime is 70114273711. The reversal of 70114273681 is 18637241107.
It is a happy number.
The square root of 70114273681 is 264791.
It is a perfect power (a square), and thus also a powerful number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is not a de Polignac number, because 70114273681 - 215 = 70114240913 is a prime.
It is a super-2 number, since 2×701142736812 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (70114273631) by changing a digit.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 132396 + ... + 397186.
Almost surely, 270114273681 is an apocalyptic number.
70114273681 is the 264791-st square number.
70114273681 is the 132396-th centered octagonal number.
It is an amenable number.
70114273681 is a deficient number, since it is larger than the sum of its proper divisors (264792).
70114273681 is an frugal number, since it uses more digits than its factorization.
70114273681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 529582 (or 264791 counting only the distinct ones).
The product of its (nonzero) digits is 56448, while the sum is 40.
The spelling of 70114273681 in words is "seventy billion, one hundred fourteen million, two hundred seventy-three thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •