Base | Representation |
---|---|
bin | 100110011011000… |
… | …1101111011100100 |
3 | 10022212000021101111 |
4 | 1030312031323210 |
5 | 10120024000002 |
6 | 331533434404 |
7 | 43643465320 |
oct | 11466157344 |
9 | 3285007344 |
10 | 1289281252 |
11 | 6018470a6 |
12 | 2bb93ba04 |
13 | 17715421c |
14 | c3330980 |
15 | 782c43d7 |
hex | 4cd8dee4 |
1289281252 has 48 divisors (see below), whose sum is σ = 2772080640. Its totient is φ = 512320032.
The previous prime is 1289281237. The next prime is 1289281283. The reversal of 1289281252 is 2521829821.
It is a super-2 number, since 2×12892812522 = 3324492293517375008, which contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 778 + ... + 50785.
It is an arithmetic number, because the mean of its divisors is an integer number (57751680).
Almost surely, 21289281252 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1289281252, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1386040320).
1289281252 is an abundant number, since it is smaller than the sum of its proper divisors (1482799388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1289281252 is a wasteful number, since it uses less digits than its factorization.
1289281252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51640 (or 51638 counting only the distinct ones).
The product of its digits is 46080, while the sum is 40.
The square root of 1289281252 is about 35906.5627984635. The cubic root of 1289281252 is about 1088.3850202087.
The spelling of 1289281252 in words is "one billion, two hundred eighty-nine million, two hundred eighty-one thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •