Base | Representation |
---|---|
bin | 100010001000010… |
… | …0110011101100010 |
3 | 2221210220022112112 |
4 | 1010100212131202 |
5 | 4321132440110 |
6 | 305345355322 |
7 | 40244026613 |
oct | 10420463542 |
9 | 2853808475 |
10 | 1145202530 |
11 | 53848967a |
12 | 27b638b42 |
13 | 153349544 |
14 | ac147c0a |
15 | 6a814405 |
hex | 44426762 |
1145202530 has 8 divisors (see below), whose sum is σ = 2061364572. Its totient is φ = 458081008.
The previous prime is 1145202493. The next prime is 1145202533. The reversal of 1145202530 is 352025411.
It can be written as a sum of positive squares in 2 ways, for example, as 1145077921 + 124609 = 33839^2 + 353^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×11452025302 = 2622977669436801800, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1145202496 and 1145202505.
It is not an unprimeable number, because it can be changed into a prime (1145202533) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 57260117 + ... + 57260136.
Almost surely, 21145202530 is an apocalyptic number.
1145202530 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1145202530 is a deficient number, since it is larger than the sum of its proper divisors (916162042).
1145202530 is a wasteful number, since it uses less digits than its factorization.
1145202530 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 114520260.
The product of its (nonzero) digits is 1200, while the sum is 23.
The square root of 1145202530 is about 33840.8411538484. The cubic root of 1145202530 is about 1046.2306358340.
Adding to 1145202530 its reverse (352025411), we get a palindrome (1497227941).
The spelling of 1145202530 in words is "one billion, one hundred forty-five million, two hundred two thousand, five hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •