Base | Representation |
---|---|
bin | 11111001010000001101… |
… | …11101101110000011000 |
3 | 10210100020102212001000222 |
4 | 33211000313231300120 |
5 | 120014424003010424 |
6 | 2135444100415212 |
7 | 140225601043550 |
oct | 17450067556030 |
9 | 3710212761028 |
10 | 1070535203864 |
11 | 383014239605 |
12 | 1535880a7508 |
13 | 79c49572a69 |
14 | 39b5817a160 |
15 | 1cca8d45e5e |
hex | f940dedc18 |
1070535203864 has 16 divisors (see below), whose sum is σ = 2294004008400. Its totient is φ = 458800801632.
The previous prime is 1070535203851. The next prime is 1070535203873. The reversal of 1070535203864 is 4683025350701.
1070535203864 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×10705352038642 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9558349979 + ... + 9558350090.
It is an arithmetic number, because the mean of its divisors is an integer number (143375250525).
Almost surely, 21070535203864 is an apocalyptic number.
1070535203864 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
1070535203864 is an abundant number, since it is smaller than the sum of its proper divisors (1223468804536).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1070535203864 is a wasteful number, since it uses less digits than its factorization.
1070535203864 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19116700082 (or 19116700078 counting only the distinct ones).
The product of its (nonzero) digits is 604800, while the sum is 44.
The spelling of 1070535203864 in words is "one trillion, seventy billion, five hundred thirty-five million, two hundred three thousand, eight hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •