Base | Representation |
---|---|
bin | 10010001110000101000… |
… | …010101101000000000000 |
3 | 11102200210202000021202010 |
4 | 102032011002231000000 |
5 | 131003213243431342 |
6 | 2355105241052520 |
7 | 156313254446550 |
oct | 22160502550000 |
9 | 4380722007663 |
10 | 1252067561472 |
11 | 442aa9551732 |
12 | 1827aaa87140 |
13 | 910b97c8690 |
14 | 4485969d160 |
15 | 22880d3b29c |
hex | 123850ad000 |
1252067561472 has 832 divisors, whose sum is σ = 4343594250240. Its totient is φ = 311738499072.
The previous prime is 1252067561443. The next prime is 1252067561489. The reversal of 1252067561472 is 2741657602521.
It is a tau number, because it is divible by the number of its divisors (832).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2288971503 + ... + 2288972049.
Almost surely, 21252067561472 is an apocalyptic number.
1252067561472 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 1252067561472, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2171797125120).
1252067561472 is an abundant number, since it is smaller than the sum of its proper divisors (3091526688768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1252067561472 is a wasteful number, since it uses less digits than its factorization.
1252067561472 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 706 (or 684 counting only the distinct ones).
The product of its (nonzero) digits is 1411200, while the sum is 48.
The spelling of 1252067561472 in words is "one trillion, two hundred fifty-two billion, sixty-seven million, five hundred sixty-one thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •