Base | Representation |
---|---|
bin | 11111001000011010110… |
… | …00000101000010111010 |
3 | 10210021000020012210012000 |
4 | 33210031120011002322 |
5 | 120011141321211014 |
6 | 2135222235401430 |
7 | 140165310540606 |
oct | 17441530050272 |
9 | 3707006183160 |
10 | 1069671272634 |
11 | 382710602258 |
12 | 1533868b3276 |
13 | 79b3c597753 |
14 | 39ab552c506 |
15 | 1cc58091509 |
hex | f90d6050ba |
1069671272634 has 16 divisors (see below), whose sum is σ = 2377047272640. Its totient is φ = 356557090860.
The previous prime is 1069671272633. The next prime is 1069671272653. The reversal of 1069671272634 is 4362721769601.
It is a super-2 number, since 2×10696712726342 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (54), and also a Moran number because the ratio is a prime number: 19808727271 = 1069671272634 / (1 + 0 + 6 + 9 + 6 + 7 + 1 + 2 + 7 + 2 + 6 + 3 + 4).
It is not an unprimeable number, because it can be changed into a prime (1069671272633) 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, 9904363582 + ... + 9904363689.
It is an arithmetic number, because the mean of its divisors is an integer number (148565454540).
Almost surely, 21069671272634 is an apocalyptic number.
1069671272634 is an abundant number, since it is smaller than the sum of its proper divisors (1307376000006).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1069671272634 is a wasteful number, since it uses less digits than its factorization.
1069671272634 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19808727282 (or 19808727276 counting only the distinct ones).
The product of its (nonzero) digits is 4572288, while the sum is 54.
The spelling of 1069671272634 in words is "one trillion, sixty-nine billion, six hundred seventy-one million, two hundred seventy-two thousand, six hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •