Base | Representation |
---|---|
bin | 111100100000010… |
… | …1011011101000011 |
3 | 12020111012220210221 |
4 | 1321000223131003 |
5 | 13124214033443 |
6 | 533242403511 |
7 | 101211411010 |
oct | 17100533503 |
9 | 5214186727 |
10 | 2030221123 |
11 | 9520091a7 |
12 | 487b00597 |
13 | 2647c8b98 |
14 | 1538c4707 |
15 | bd381eed |
hex | 7902b743 |
2030221123 has 8 divisors (see below), whose sum is σ = 2335619840. Its totient is φ = 1728664200.
The previous prime is 2030221121. The next prime is 2030221133. The reversal of 2030221123 is 3211220302.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2030221123 - 21 = 2030221121 is a prime.
It is a super-2 number, since 2×20302211232 = 8243595616550762258, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2030221097 and 2030221106.
It is not an unprimeable number, because it can be changed into a prime (2030221121) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 959313 + ... + 961426.
It is an arithmetic number, because the mean of its divisors is an integer number (291952480).
Almost surely, 22030221123 is an apocalyptic number.
2030221123 is a deficient number, since it is larger than the sum of its proper divisors (305398717).
2030221123 is a wasteful number, since it uses less digits than its factorization.
2030221123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1920897.
The product of its (nonzero) digits is 144, while the sum is 16.
The square root of 2030221123 is about 45057.9751320452. The cubic root of 2030221123 is about 1266.2353896551.
Adding to 2030221123 its reverse (3211220302), we get a palindrome (5241441425).
The spelling of 2030221123 in words is "two billion, thirty million, two hundred twenty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •