Base | Representation |
---|---|
bin | 1011111111101000111… |
… | …01011001111010001001 |
3 | 1110101202120120212202021 |
4 | 11333310131121322021 |
5 | 23223012022221441 |
6 | 513154331204441 |
7 | 41526540521143 |
oct | 5776435317211 |
9 | 1411676525667 |
10 | 412123242121 |
11 | 14986490a668 |
12 | 67a572a6721 |
13 | 2cb2b1936a6 |
14 | 15d38301c93 |
15 | aac0db03d1 |
hex | 5ff4759e89 |
412123242121 has 4 divisors (see below), whose sum is σ = 412124526612. Its totient is φ = 412121957632.
The previous prime is 412123242077. The next prime is 412123242127. The reversal of 412123242121 is 121242321214.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 177905960521 + 234217281600 = 421789^2 + 483960^2 .
It is a cyclic number.
It is not a de Polignac number, because 412123242121 - 29 = 412123241609 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (412123242127) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 292845 + ... + 953941.
It is an arithmetic number, because the mean of its divisors is an integer number (103031131653).
Almost surely, 2412123242121 is an apocalyptic number.
It is an amenable number.
412123242121 is a deficient number, since it is larger than the sum of its proper divisors (1284491).
412123242121 is an equidigital number, since it uses as much as digits as its factorization.
412123242121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1284490.
The product of its digits is 1536, while the sum is 25.
Adding to 412123242121 its reverse (121242321214), we get a palindrome (533365563335).
The spelling of 412123242121 in words is "four hundred twelve billion, one hundred twenty-three million, two hundred forty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •