Base | Representation |
---|---|
bin | 10010010010010101000110… |
… | …01110000101110011011111 |
3 | 12021101020202220110001022202 |
4 | 21021022203032011303133 |
5 | 20232314112341031101 |
6 | 221305123450402115 |
7 | 11320144232033633 |
oct | 1111124316056337 |
9 | 167336686401282 |
10 | 40212222205151 |
11 | 118a39a9116967 |
12 | 4615493a3033b |
13 | 1958cc4aab799 |
14 | 9d03d38dadc3 |
15 | 49b02b1a536b |
hex | 2492a3385cdf |
40212222205151 has 2 divisors, whose sum is σ = 40212222205152. Its totient is φ = 40212222205150.
The previous prime is 40212222205147. The next prime is 40212222205231. The reversal of 40212222205151 is 15150222221204.
40212222205151 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 is a cyclic number.
It is not a de Polignac number, because 40212222205151 - 22 = 40212222205147 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (40212222255151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20106111102575 + 20106111102576.
It is an arithmetic number, because the mean of its divisors is an integer number (20106111102576).
Almost surely, 240212222205151 is an apocalyptic number.
40212222205151 is a deficient number, since it is larger than the sum of its proper divisors (1).
40212222205151 is an equidigital number, since it uses as much as digits as its factorization.
40212222205151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6400, while the sum is 29.
Adding to 40212222205151 its reverse (15150222221204), we get a palindrome (55362444426355).
The spelling of 40212222205151 in words is "forty trillion, two hundred twelve billion, two hundred twenty-two million, two hundred five thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •