Base | Representation |
---|---|
bin | 100010000111111… |
… | …1100011100010111 |
3 | 2221210120120110012 |
4 | 1010033330130113 |
5 | 4321111433143 |
6 | 305341550435 |
7 | 40242412055 |
oct | 10417743427 |
9 | 2853516405 |
10 | 1145030423 |
11 | 538381339 |
12 | 27b57541b |
13 | 1532b90c4 |
14 | ac1011d5 |
15 | 6a7cd418 |
hex | 443fc717 |
1145030423 has 4 divisors (see below), whose sum is σ = 1145165880. Its totient is φ = 1144894968.
The previous prime is 1145030407. The next prime is 1145030441. The reversal of 1145030423 is 3240305411.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1145030423 - 24 = 1145030407 is a prime.
It is a super-2 number, since 2×11450304232 = 2622189339191117858, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1145030473) 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 3 ways as a sum of consecutive naturals, for example, 54140 + ... + 72257.
It is an arithmetic number, because the mean of its divisors is an integer number (286291470).
Almost surely, 21145030423 is an apocalyptic number.
1145030423 is a deficient number, since it is larger than the sum of its proper divisors (135457).
1145030423 is an equidigital number, since it uses as much as digits as its factorization.
1145030423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135456.
The product of its (nonzero) digits is 1440, while the sum is 23.
The square root of 1145030423 is about 33838.2981693820. The cubic root of 1145030423 is about 1046.1782222121.
Adding to 1145030423 its reverse (3240305411), we get a palindrome (4385335834).
The spelling of 1145030423 in words is "one billion, one hundred forty-five million, thirty thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •