Base | Representation |
---|---|
bin | 100110101000001… |
… | …0000001000100100 |
3 | 10100022212000012200 |
4 | 1031100100020210 |
5 | 10123300343040 |
6 | 332340014500 |
7 | 44055501516 |
oct | 11520201044 |
9 | 3308760180 |
10 | 1296106020 |
11 | 605688700 |
12 | 302091430 |
13 | 1786a3751 |
14 | c41c9bb6 |
15 | 78bc1630 |
hex | 4d410224 |
1296106020 has 108 divisors (see below), whose sum is σ = 4321497180. Its totient is φ = 314202240.
The previous prime is 1296105983. The next prime is 1296106039. The reversal of 1296106020 is 206016921.
1296106020 is a `hidden beast` number, since 1 + 29 + 610 + 6 + 0 + 20 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 224460324 + 1071645696 = 14982^2 + 32736^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 7975 + ... + 51534.
Almost surely, 21296106020 is an apocalyptic number.
1296106020 is a gapful number since it is divisible by the number (10) 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 1296106020, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2160748590).
1296106020 is an abundant number, since it is smaller than the sum of its proper divisors (3025391160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1296106020 is a wasteful number, since it uses less digits than its factorization.
1296106020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59546 (or 59530 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 27.
The square root of 1296106020 is about 36001.4724698866. The cubic root of 1296106020 is about 1090.3020850005.
The spelling of 1296106020 in words is "one billion, two hundred ninety-six million, one hundred six thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •