Base | Representation |
---|---|
bin | 100101000110000… |
… | …0111001100000000 |
3 | 10012202002202112020 |
4 | 1022030013030000 |
5 | 10022120023102 |
6 | 323302001440 |
7 | 42562453230 |
oct | 11214071400 |
9 | 3182082466 |
10 | 1244689152 |
11 | 58965a423 |
12 | 2a8a16280 |
13 | 16ab40475 |
14 | bb443cc0 |
15 | 74416bbc |
hex | 4a307300 |
1244689152 has 144 divisors (see below), whose sum is σ = 3878956032. Its totient is φ = 346890240.
The previous prime is 1244689141. The next prime is 1244689157. The reversal of 1244689152 is 2519864421.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1244689157) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 217593 + ... + 223239.
Almost surely, 21244689152 is an apocalyptic number.
1244689152 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 1244689152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1939478016).
1244689152 is an abundant number, since it is smaller than the sum of its proper divisors (2634266880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1244689152 is an equidigital number, since it uses as much as digits as its factorization.
1244689152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5714 (or 5700 counting only the distinct ones).
The product of its digits is 138240, while the sum is 42.
The square root of 1244689152 is about 35280.1523806233. The cubic root of 1244689152 is about 1075.6895959754.
The spelling of 1244689152 in words is "one billion, two hundred forty-four million, six hundred eighty-nine thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •