Base | Representation |
---|---|
bin | 111100100000101… |
… | …1100010010000011 |
3 | 12020111121002011100 |
4 | 1321001130102003 |
5 | 13124241433443 |
6 | 533250545443 |
7 | 101213203053 |
oct | 17101342203 |
9 | 5214532140 |
10 | 2030421123 |
11 | 952135495 |
12 | 487b98283 |
13 | 264868c23 |
14 | 153937563 |
15 | bd3c13d3 |
hex | 7905c483 |
2030421123 has 12 divisors (see below), whose sum is σ = 2933267688. Its totient is φ = 1353412320.
The previous prime is 2030421121. The next prime is 2030421137. The reversal of 2030421123 is 3211240302.
It is not a de Polignac number, because 2030421123 - 21 = 2030421121 is a prime.
It is a super-2 number, since 2×20304211232 = 8245219873449162258, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2030421096 and 2030421105.
It is not an unprimeable number, because it can be changed into a prime (2030421121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 71128 + ... + 95498.
It is an arithmetic number, because the mean of its divisors is an integer number (244438974).
Almost surely, 22030421123 is an apocalyptic number.
2030421123 is a deficient number, since it is larger than the sum of its proper divisors (902846565).
2030421123 is a wasteful number, since it uses less digits than its factorization.
2030421123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33634 (or 33631 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
The square root of 2030421123 is about 45060.1944403262. The cubic root of 2030421123 is about 1266.2769678457.
Adding to 2030421123 its reverse (3211240302), we get a palindrome (5241661425).
The spelling of 2030421123 in words is "two billion, thirty million, four hundred twenty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •