Base | Representation |
---|---|
bin | 100010000111111… |
… | …1001111101001001 |
3 | 2221210120001110210 |
4 | 1010033321331021 |
5 | 4321111121413 |
6 | 305341431333 |
7 | 40242340260 |
oct | 10417717511 |
9 | 2853501423 |
10 | 1145020233 |
11 | 538374715 |
12 | 27b56b549 |
13 | 1532b4586 |
14 | ac0db5d7 |
15 | 6a7ca3c3 |
hex | 443f9f49 |
1145020233 has 16 divisors (see below), whose sum is σ = 1766881280. Its totient is φ = 646014096.
The previous prime is 1145020231. The next prime is 1145020259. The reversal of 1145020233 is 3320205411.
It is not a de Polignac number, because 1145020233 - 21 = 1145020231 is a prime.
It is a super-2 number, since 2×11450202332 = 2622142667958748578, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1145020231) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 343435 + ... + 346752.
It is an arithmetic number, because the mean of its divisors is an integer number (110430080).
Almost surely, 21145020233 is an apocalyptic number.
It is an amenable number.
1145020233 is a deficient number, since it is larger than the sum of its proper divisors (621861047).
1145020233 is an equidigital number, since it uses as much as digits as its factorization.
1145020233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 690276.
The product of its (nonzero) digits is 720, while the sum is 21.
The square root of 1145020233 is about 33838.1476000091. The cubic root of 1145020233 is about 1046.1751187756.
Adding to 1145020233 its reverse (3320205411), we get a palindrome (4465225644).
The spelling of 1145020233 in words is "one billion, one hundred forty-five million, twenty thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •