Base | Representation |
---|---|
bin | 1010011001100111001111… |
… | …00010010001110000111101 |
3 | 2222222101012212020201020220 |
4 | 11030303213202101300331 |
5 | 10444201323321001321 |
6 | 120350244422531553 |
7 | 4550216054643501 |
oct | 514634742216075 |
9 | 88871185221226 |
10 | 22870290406461 |
11 | 7318265786323 |
12 | 26944b9b96bb9 |
13 | c9b87515b354 |
14 | 590cdc482301 |
15 | 299d96ecc9c6 |
hex | 14cce7891c3d |
22870290406461 has 4 divisors (see below), whose sum is σ = 30493720541952. Its totient is φ = 15246860270972.
The previous prime is 22870290406451. The next prime is 22870290406529. The reversal of 22870290406461 is 16460409207822.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 22870290406461 - 211 = 22870290404413 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22870290406451) 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 in 3 ways as a sum of consecutive naturals, for example, 3811715067741 + ... + 3811715067746.
It is an arithmetic number, because the mean of its divisors is an integer number (7623430135488).
Almost surely, 222870290406461 is an apocalyptic number.
It is an amenable number.
22870290406461 is a deficient number, since it is larger than the sum of its proper divisors (7623430135491).
22870290406461 is an equidigital number, since it uses as much as digits as its factorization.
22870290406461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7623430135490.
The product of its (nonzero) digits is 2322432, while the sum is 51.
The spelling of 22870290406461 in words is "twenty-two trillion, eight hundred seventy billion, two hundred ninety million, four hundred six thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •