Base | Representation |
---|---|
bin | 10011001101000100010010… |
… | …01100100111111010110011 |
3 | 12112112012002121002221221021 |
4 | 21212202021030213322303 |
5 | 21013400400040221344 |
6 | 225452215350440311 |
7 | 11616022116224215 |
oct | 1146421114477263 |
9 | 175465077087837 |
10 | 42230420242099 |
11 | 12501903311201 |
12 | 48a0656363097 |
13 | 1a744085c104b |
14 | a5dd6b2085b5 |
15 | 4d379bb08b84 |
hex | 266889327eb3 |
42230420242099 has 2 divisors, whose sum is σ = 42230420242100. Its totient is φ = 42230420242098.
The previous prime is 42230420242063. The next prime is 42230420242133. The reversal of 42230420242099 is 99024202403224.
It is a happy number.
42230420242099 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 42230420242099 - 235 = 42196060503731 is a prime.
It is a super-3 number, since 3×422304202420993 (a number of 42 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (42230420242019) 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, 21115210121049 + 21115210121050.
It is an arithmetic number, because the mean of its divisors is an integer number (21115210121050).
Almost surely, 242230420242099 is an apocalyptic number.
42230420242099 is a deficient number, since it is larger than the sum of its proper divisors (1).
42230420242099 is an equidigital number, since it uses as much as digits as its factorization.
42230420242099 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 497664, while the sum is 43.
The spelling of 42230420242099 in words is "forty-two trillion, two hundred thirty billion, four hundred twenty million, two hundred forty-two thousand, ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •