Base | Representation |
---|---|
bin | 111100100000001… |
… | …0111111110001011 |
3 | 12020111001212100101 |
4 | 1321000113332023 |
5 | 13124204010243 |
6 | 533240550231 |
7 | 101210626240 |
oct | 17100277613 |
9 | 5214055311 |
10 | 2030141323 |
11 | 951a64251 |
12 | 487a82377 |
13 | 26479b772 |
14 | 1538a35c7 |
15 | bd36854d |
hex | 79017f8b |
2030141323 has 4 divisors (see below), whose sum is σ = 2320161520. Its totient is φ = 1740121128.
The previous prime is 2030141293. The next prime is 2030141329. The reversal of 2030141323 is 3231410302.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2030141323 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2030141323.
It is not an unprimeable number, because it can be changed into a prime (2030141329) 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, 145010088 + ... + 145010101.
It is an arithmetic number, because the mean of its divisors is an integer number (580040380).
Almost surely, 22030141323 is an apocalyptic number.
2030141323 is a deficient number, since it is larger than the sum of its proper divisors (290020197).
2030141323 is an equidigital number, since it uses as much as digits as its factorization.
2030141323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 290020196.
The product of its (nonzero) digits is 432, while the sum is 19.
The square root of 2030141323 is about 45057.0895975317. The cubic root of 2030141323 is about 1266.2187991950.
Adding to 2030141323 its reverse (3231410302), we get a palindrome (5261551625).
The spelling of 2030141323 in words is "two billion, thirty million, one hundred forty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •