Base | Representation |
---|---|
bin | 100010001000000… |
… | …1101100001000000 |
3 | 2221210201010101011 |
4 | 1010100031201000 |
5 | 4321121202402 |
6 | 305343250304 |
7 | 40243122664 |
oct | 10420154100 |
9 | 2853633334 |
10 | 1145100352 |
11 | 538419930 |
12 | 27b5a9994 |
13 | 153311b96 |
14 | ac11c8a4 |
15 | 6a7e3ed7 |
hex | 4440d840 |
1145100352 has 56 divisors (see below), whose sum is σ = 2484059040. Its totient is φ = 519413760.
The previous prime is 1145100349. The next prime is 1145100373. The reversal of 1145100352 is 2530015411.
It is a happy number.
It is a super-2 number, since 2×11451003522 = 2622509632301047808, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 404799 + ... + 407617.
Almost surely, 21145100352 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 1145100352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1242029520).
1145100352 is an abundant number, since it is smaller than the sum of its proper divisors (1338958688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1145100352 is a wasteful number, since it uses less digits than its factorization.
1145100352 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3419 (or 3409 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 22.
The square root of 1145100352 is about 33839.3314354761. The cubic root of 1145100352 is about 1046.1995190866.
Adding to 1145100352 its reverse (2530015411), we get a palindrome (3675115763).
The spelling of 1145100352 in words is "one billion, one hundred forty-five million, one hundred thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •