Base | Representation |
---|---|
bin | 1000010001110001110… |
… | …0010011111010011110 |
3 | 111121001221021121210021 |
4 | 2010130130103322132 |
5 | 4312222020320124 |
6 | 145155245302354 |
7 | 13163060304601 |
oct | 2043434237236 |
9 | 447057247707 |
10 | 142211104414 |
11 | 55347508665 |
12 | 2368a2649ba |
13 | 105449b0ac2 |
14 | 6c5115a338 |
15 | 3a74dd37e4 |
hex | 211c713e9e |
142211104414 has 4 divisors (see below), whose sum is σ = 213316656624. Its totient is φ = 71105552206.
The previous prime is 142211104397. The next prime is 142211104439. The reversal of 142211104414 is 414401112241.
142211104414 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 414401112241 = 41 ⋅10107344201.
It is a super-2 number, since 2×1422111044142 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 35552776102 + ... + 35552776105.
It is an arithmetic number, because the mean of its divisors is an integer number (53329164156).
Almost surely, 2142211104414 is an apocalyptic number.
142211104414 is a deficient number, since it is larger than the sum of its proper divisors (71105552210).
142211104414 is an equidigital number, since it uses as much as digits as its factorization.
142211104414 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71105552209.
The product of its (nonzero) digits is 1024, while the sum is 25.
Adding to 142211104414 its reverse (414401112241), we get a palindrome (556612216655).
The spelling of 142211104414 in words is "one hundred forty-two billion, two hundred eleven million, one hundred four thousand, four hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •