Base | Representation |
---|---|
bin | 100010000000101… |
… | …0010001000000000 |
3 | 2221112100022100212 |
4 | 1010001102020000 |
5 | 4314120441242 |
6 | 305123333252 |
7 | 40164634004 |
oct | 10401221000 |
9 | 2845308325 |
10 | 1141187072 |
11 | 536196813 |
12 | 27a221228 |
13 | 15257192c |
14 | ab7c0704 |
15 | 6a2be782 |
hex | 44052200 |
1141187072 has 60 divisors (see below), whose sum is σ = 2332000110. Its totient is φ = 557899776.
The previous prime is 1141187057. The next prime is 1141187083. The reversal of 1141187072 is 2707811411.
It can be written as a sum of positive squares in only one way, i.e., 1045616896 + 95570176 = 32336^2 + 9776^2 .
It is a Harshad number since it is a multiple of its sum of digits (32).
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1130504 + ... + 1131512.
Almost surely, 21141187072 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 1141187072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1166000055).
1141187072 is an abundant number, since it is smaller than the sum of its proper divisors (1190813038).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1141187072 is an frugal number, since it uses more digits than its factorization.
1141187072 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1121 (or 1058 counting only the distinct ones).
The product of its (nonzero) digits is 3136, while the sum is 32.
The square root of 1141187072 is about 33781.4604776052. The cubic root of 1141187072 is about 1045.0063938926.
Adding to 1141187072 its reverse (2707811411), we get a palindrome (3848998483).
The spelling of 1141187072 in words is "one billion, one hundred forty-one million, one hundred eighty-seven thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •