Base | Representation |
---|---|
bin | 11111111001110101100111… |
… | …11101010101111001101001 |
3 | 100012101221112000001222012011 |
4 | 33330322303331111321221 |
5 | 33143423031320440032 |
6 | 405113404320115521 |
7 | 20530451143161100 |
oct | 1774726375257151 |
9 | 305357460058164 |
10 | 70157015015017 |
11 | 20399471a93947 |
12 | 7a50a96465ba1 |
13 | 301ba16718508 |
14 | 1347890b61037 |
15 | 819e293a8247 |
hex | 3fceb3f55e69 |
70157015015017 has 12 divisors (see below), whose sum is σ = 81611553278676. Its totient is φ = 60134339865600.
The previous prime is 70157015014993. The next prime is 70157015015057. The reversal of 70157015015017 is 71051051075107.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 57631722501136 + 12525292513881 = 7591556^2 + 3539109^2 .
It is a de Polignac number, because none of the positive numbers 2k-70157015015017 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (70157015015057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 9831433 + ... + 15393865.
It is an arithmetic number, because the mean of its divisors is an integer number (6800962773223).
Almost surely, 270157015015017 is an apocalyptic number.
It is an amenable number.
70157015015017 is a deficient number, since it is larger than the sum of its proper divisors (11454538263659).
70157015015017 is a wasteful number, since it uses less digits than its factorization.
70157015015017 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5819848 (or 5819841 counting only the distinct ones).
The product of its (nonzero) digits is 42875, while the sum is 40.
The spelling of 70157015015017 in words is "seventy trillion, one hundred fifty-seven billion, fifteen million, fifteen thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •