Base | Representation |
---|---|
bin | 100110111001010… |
… | …1110010000000000 |
3 | 10100221212002121200 |
4 | 1031302232100000 |
5 | 10133104023042 |
6 | 333301421200 |
7 | 44225345340 |
oct | 11562562000 |
9 | 3327762550 |
10 | 1305142272 |
11 | 60a79a785 |
12 | 30510a800 |
13 | 17a518745 |
14 | c549cd20 |
15 | 798a8c4c |
hex | 4dcae400 |
1305142272 has 132 divisors (see below), whose sum is σ = 4307150016. Its totient is φ = 372879360.
The previous prime is 1305142271. The next prime is 1305142283. The reversal of 1305142272 is 2722415031.
It is a super-2 number, since 2×13051422722 = 3406792700322643968, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1305142271) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 54397 + ... + 74627.
Almost surely, 21305142272 is an apocalyptic number.
1305142272 is a gapful number since it is divisible by the number (12) 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 1305142272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2153575008).
1305142272 is an abundant number, since it is smaller than the sum of its proper divisors (3002007744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1305142272 is a wasteful number, since it uses less digits than its factorization.
1305142272 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20264 (or 20243 counting only the distinct ones).
The product of its (nonzero) digits is 3360, while the sum is 27.
The square root of 1305142272 is about 36126.7528571279. The cubic root of 1305142272 is about 1092.8300254636.
The spelling of 1305142272 in words is "one billion, three hundred five million, one hundred forty-two thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •