Base | Representation |
---|---|
bin | 100000101001111100… |
… | …0100001001110101100 |
3 | 20201000020221122021220 |
4 | 1001103320201032230 |
5 | 2122104430124321 |
6 | 52114340423340 |
7 | 5031543660210 |
oct | 1012370411654 |
9 | 221006848256 |
10 | 70126801836 |
11 | 2781682a183 |
12 | 117113a7b50 |
13 | 67c77b3520 |
14 | 35737c2940 |
15 | 1c5680b9c6 |
hex | 1053e213ac |
70126801836 has 96 divisors (see below), whose sum is σ = 201828092928. Its totient is φ = 18454728960.
The previous prime is 70126801831. The next prime is 70126801889. The reversal of 70126801836 is 63810862107.
It is a super-2 number, since 2×701268018362 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is not an unprimeable number, because it can be changed into a prime (70126801831) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 433761 + ... + 573063.
It is an arithmetic number, because the mean of its divisors is an integer number (2102375968).
Almost surely, 270126801836 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 70126801836, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (100914046464).
70126801836 is an abundant number, since it is smaller than the sum of its proper divisors (131701291092).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
70126801836 is a wasteful number, since it uses less digits than its factorization.
70126801836 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 139791 (or 139789 counting only the distinct ones).
The product of its (nonzero) digits is 96768, while the sum is 42.
The spelling of 70126801836 in words is "seventy billion, one hundred twenty-six million, eight hundred one thousand, eight hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •