Base | Representation |
---|---|
bin | 101000001101010… |
… | …1001011010100000 |
3 | 10111000200120020021 |
4 | 1100122221122200 |
5 | 10230341201111 |
6 | 341513123224 |
7 | 45301456552 |
oct | 12032513240 |
9 | 3430616207 |
10 | 1349162656 |
11 | 632626966 |
12 | 3179b9514 |
13 | 18668c1ca |
14 | cb27b4d2 |
15 | 7d6a1d71 |
hex | 506a96a0 |
1349162656 has 48 divisors (see below), whose sum is σ = 2763694080. Its totient is φ = 647619840.
The previous prime is 1349162629. The next prime is 1349162657. The reversal of 1349162656 is 6562619431.
It is not an unprimeable number, because it can be changed into a prime (1349162657) 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, 120630 + ... + 131338.
It is an arithmetic number, because the mean of its divisors is an integer number (57576960).
Almost surely, 21349162656 is an apocalyptic number.
1349162656 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1349162656, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1381847040).
1349162656 is an abundant number, since it is smaller than the sum of its proper divisors (1414531424).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1349162656 is a wasteful number, since it uses less digits than its factorization.
1349162656 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10877 (or 10869 counting only the distinct ones).
The product of its digits is 233280, while the sum is 43.
The square root of 1349162656 is about 36730.9495657273. The cubic root of 1349162656 is about 1104.9808985048.
The spelling of 1349162656 in words is "one billion, three hundred forty-nine million, one hundred sixty-two thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •