Base | Representation |
---|---|
bin | 111011110111110000000… |
… | …110110100100010001001 |
3 | 112120022202110221002200102 |
4 | 323313300012310202021 |
5 | 1014402102334202103 |
6 | 12430031105215145 |
7 | 603151326110534 |
oct | 73676006644211 |
9 | 15508673832612 |
10 | 4114312022153 |
11 | 1346962970853 |
12 | 56546a9314b5 |
13 | 23ac93763c28 |
14 | 1031c3099a1b |
15 | 7205190de88 |
hex | 3bdf01b4889 |
4114312022153 has 2 divisors, whose sum is σ = 4114312022154. Its totient is φ = 4114312022152.
The previous prime is 4114312022147. The next prime is 4114312022201. The reversal of 4114312022153 is 3512202134114.
It is a happy number.
4114312022153 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., 3891138924409 + 223173097744 = 1972597^2 + 472412^2 .
It is a cyclic number.
It is not a de Polignac number, because 4114312022153 - 24 = 4114312022137 is a prime.
It is not a weakly prime, because it can be changed into another prime (4114312022053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2057156011076 + 2057156011077.
It is an arithmetic number, because the mean of its divisors is an integer number (2057156011077).
Almost surely, 24114312022153 is an apocalyptic number.
It is an amenable number.
4114312022153 is a deficient number, since it is larger than the sum of its proper divisors (1).
4114312022153 is an equidigital number, since it uses as much as digits as its factorization.
4114312022153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5760, while the sum is 29.
Adding to 4114312022153 its reverse (3512202134114), we get a palindrome (7626514156267).
The spelling of 4114312022153 in words is "four trillion, one hundred fourteen billion, three hundred twelve million, twenty-two thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •