Base | Representation |
---|---|
bin | 11111001000100010111… |
… | …10010010110010011010 |
3 | 10210021012000120001000110 |
4 | 33210101132102302122 |
5 | 120011311420320100 |
6 | 2135233132545150 |
7 | 140200104030153 |
oct | 17442136226232 |
9 | 3707160501013 |
10 | 1069740010650 |
11 | 382746391133 |
12 | 1533a59221b6 |
13 | 79b508b3a2c |
14 | 39ac070292a |
15 | 1cc5e11d250 |
hex | f911792c9a |
1069740010650 has 24 divisors (see below), whose sum is σ = 2652955226784. Its totient is φ = 285264002800.
The previous prime is 1069740010597. The next prime is 1069740010667. The reversal of 1069740010650 is 560100479601.
1069740010650 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×10697400106502 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1069740010599 and 1069740010608.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3565799886 + ... + 3565800185.
It is an arithmetic number, because the mean of its divisors is an integer number (110539801116).
Almost surely, 21069740010650 is an apocalyptic number.
1069740010650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1069740010650 is an abundant number, since it is smaller than the sum of its proper divisors (1583215216134).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1069740010650 is a wasteful number, since it uses less digits than its factorization.
1069740010650 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7131600086 (or 7131600081 counting only the distinct ones).
The product of its (nonzero) digits is 45360, while the sum is 39.
The spelling of 1069740010650 in words is "one trillion, sixty-nine billion, seven hundred forty million, ten thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •