Base | Representation |
---|---|
bin | 10011001110000111101011… |
… | …11101001000000101010011 |
3 | 12112122122111100102112201222 |
4 | 21213003311331020011103 |
5 | 21014444001241300301 |
6 | 225521002103515255 |
7 | 11621442602412401 |
oct | 1147036575100523 |
9 | 175578440375658 |
10 | 42266604634451 |
11 | 1251619147879a |
12 | 48a7674458b2b |
13 | 1a779540030b2 |
14 | a61a00b40471 |
15 | 4d46b864031b |
hex | 2670f5f48153 |
42266604634451 has 2 divisors, whose sum is σ = 42266604634452. Its totient is φ = 42266604634450.
The previous prime is 42266604634439. The next prime is 42266604634511. The reversal of 42266604634451 is 15443640666224.
42266604634451 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 a de Polignac number, because none of the positive numbers 2k-42266604634451 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 42266604634393 and 42266604634402.
It is not a weakly prime, because it can be changed into another prime (42266604634411) 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, 21133302317225 + 21133302317226.
It is an arithmetic number, because the mean of its divisors is an integer number (21133302317226).
Almost surely, 242266604634451 is an apocalyptic number.
42266604634451 is a deficient number, since it is larger than the sum of its proper divisors (1).
42266604634451 is an equidigital number, since it uses as much as digits as its factorization.
42266604634451 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 19906560, while the sum is 53.
The spelling of 42266604634451 in words is "forty-two trillion, two hundred sixty-six billion, six hundred four million, six hundred thirty-four thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •