Base | Representation |
---|---|
bin | 111010110100100001010… |
… | …100010111011000110101 |
3 | 112022102102111221121012202 |
4 | 322310201110113120311 |
5 | 1012211232020243331 |
6 | 12332531544354245 |
7 | 565014403256264 |
oct | 72644124273065 |
9 | 15272374847182 |
10 | 4042123212341 |
11 | 13192891a2555 |
12 | 553482a75985 |
13 | 23422aa05456 |
14 | dd8d58ba5db |
15 | 70229091ecb |
hex | 3ad21517635 |
4042123212341 has 2 divisors, whose sum is σ = 4042123212342. Its totient is φ = 4042123212340.
The previous prime is 4042123212319. The next prime is 4042123212409. The reversal of 4042123212341 is 1432123212404.
4042123212341 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3593697447025 + 448425765316 = 1895705^2 + 669646^2 .
It is a cyclic number.
It is not a de Polignac number, because 4042123212341 - 230 = 4041049470517 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4042123212301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2021061606170 + 2021061606171.
It is an arithmetic number, because the mean of its divisors is an integer number (2021061606171).
Almost surely, 24042123212341 is an apocalyptic number.
It is an amenable number.
4042123212341 is a deficient number, since it is larger than the sum of its proper divisors (1).
4042123212341 is an equidigital number, since it uses as much as digits as its factorization.
4042123212341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9216, while the sum is 29.
Adding to 4042123212341 its reverse (1432123212404), we get a palindrome (5474246424745).
The spelling of 4042123212341 in words is "four trillion, forty-two billion, one hundred twenty-three million, two hundred twelve thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •