Base | Representation |
---|---|
bin | 10011001101101010100111… |
… | …11000010001100101000111 |
3 | 12112121011012212121000101002 |
4 | 21212311103320101211013 |
5 | 21014220022120124001 |
6 | 225505501450123515 |
7 | 11620351116041045 |
oct | 1146652370214507 |
9 | 175534185530332 |
10 | 42251000551751 |
11 | 1250a60436a482 |
12 | 48a463a72059b |
13 | 1a7633828c074 |
14 | a60d605cd395 |
15 | 4d40a37a346b |
hex | 266d53e11947 |
42251000551751 has 2 divisors, whose sum is σ = 42251000551752. Its totient is φ = 42251000551750.
The previous prime is 42251000551741. The next prime is 42251000551787. The reversal of 42251000551751 is 15715500015224.
It is a happy number.
42251000551751 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 42251000551751 - 242 = 37852954040647 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (42251000551741) 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, 21125500275875 + 21125500275876.
It is an arithmetic number, because the mean of its divisors is an integer number (21125500275876).
Almost surely, 242251000551751 is an apocalyptic number.
42251000551751 is a deficient number, since it is larger than the sum of its proper divisors (1).
42251000551751 is an equidigital number, since it uses as much as digits as its factorization.
42251000551751 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 70000, while the sum is 38.
Adding to 42251000551751 its reverse (15715500015224), we get a palindrome (57966500566975).
The spelling of 42251000551751 in words is "forty-two trillion, two hundred fifty-one billion, five hundred fifty-one thousand, seven hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •