Base | Representation |
---|---|
bin | 11101000111111101111… |
… | …01000010000100100001 |
3 | 10112200000012002021001111 |
4 | 32203332331002010201 |
5 | 112343423203343201 |
6 | 2043415244303321 |
7 | 132204344110051 |
oct | 16437675020441 |
9 | 3480005067044 |
10 | 1000709824801 |
11 | 356442675865 |
12 | 141b3b841b41 |
13 | 7349c367b0b |
14 | 3661281b561 |
15 | 1b06dc29b51 |
hex | e8fef42121 |
1000709824801 has 8 divisors (see below), whose sum is σ = 1033923725120. Its totient is φ = 967947814512.
The previous prime is 1000709824771. The next prime is 1000709824811. The reversal of 1000709824801 is 1084289070001.
It is a happy number.
1000709824801 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 1000709824801 - 225 = 1000676270369 is a prime.
It is a super-2 number, since 2×10007098248012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1000709824811) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 112968006 + ... + 112976863.
It is an arithmetic number, because the mean of its divisors is an integer number (129240465640).
Almost surely, 21000709824801 is an apocalyptic number.
It is an amenable number.
1000709824801 is a deficient number, since it is larger than the sum of its proper divisors (33213900319).
1000709824801 is a wasteful number, since it uses less digits than its factorization.
1000709824801 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 225945015.
The product of its (nonzero) digits is 32256, while the sum is 40.
The spelling of 1000709824801 in words is "one trillion, seven hundred nine million, eight hundred twenty-four thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •