Base | Representation |
---|---|
bin | 100010000111111… |
… | …1111011100001100 |
3 | 2221210121012021220 |
4 | 1010033333130030 |
5 | 4321112331300 |
6 | 305342123340 |
7 | 40242462624 |
oct | 10417773414 |
9 | 2853535256 |
10 | 1145042700 |
11 | 53838a58a |
12 | 27b580550 |
13 | 1532c1879 |
14 | ac105884 |
15 | 6a7d1da0 |
hex | 443ff70c |
1145042700 has 144 divisors (see below), whose sum is σ = 3483110400. Its totient is φ = 290062080.
The previous prime is 1145042693. The next prime is 1145042713. The reversal of 1145042700 is 72405411.
It is a super-2 number, since 2×11450427002 = 2622245569646580000, which contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 476101 + ... + 478499.
Almost surely, 21145042700 is an apocalyptic number.
1145042700 is a gapful number since it is divisible by the number (10) 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 1145042700, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1741555200).
1145042700 is an abundant number, since it is smaller than the sum of its proper divisors (2338067700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1145042700 is a wasteful number, since it uses less digits than its factorization.
1145042700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2496 (or 2489 counting only the distinct ones).
The product of its (nonzero) digits is 1120, while the sum is 24.
The square root of 1145042700 is about 33838.4795757729. The cubic root of 1145042700 is about 1046.1819612348.
The spelling of 1145042700 in words is "one billion, one hundred forty-five million, forty-two thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •