Base | Representation |
---|---|
bin | 11000011111111… |
… | …010101101011011 |
3 | 1001122101222121112 |
4 | 120133322231123 |
5 | 1320210120443 |
6 | 104441330535 |
7 | 13120420253 |
oct | 3037725533 |
9 | 1048358545 |
10 | 411020123 |
11 | 1a1012558 |
12 | b5796a4b |
13 | 671cc597 |
14 | 3c832963 |
15 | 2613db18 |
hex | 187fab5b |
411020123 has 8 divisors (see below), whose sum is σ = 420863040. Its totient is φ = 401223040.
The previous prime is 411020119. The next prime is 411020167. The reversal of 411020123 is 321020114.
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 411020123 - 22 = 411020119 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 411020098 and 411020107.
It is not an unprimeable number, because it can be changed into a prime (411020923) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7043 + ... + 29523.
It is an arithmetic number, because the mean of its divisors is an integer number (52607880).
Almost surely, 2411020123 is an apocalyptic number.
411020123 is a deficient number, since it is larger than the sum of its proper divisors (9842917).
411020123 is a wasteful number, since it uses less digits than its factorization.
411020123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22917.
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 411020123 is about 20273.6312238336. The cubic root of 411020123 is about 743.5115081387.
Adding to 411020123 its reverse (321020114), we get a palindrome (732040237).
Subtracting from 411020123 its reverse (321020114), we obtain a palindrome (90000009).
The spelling of 411020123 in words is "four hundred eleven million, twenty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •