Base | Representation |
---|---|
bin | 1001000111001111011111… |
… | …1000001011001010100101 |
3 | 1022110220102120222012120112 |
4 | 2101303313320023022211 |
5 | 2303132001220314141 |
6 | 33151045035142405 |
7 | 2052631332250661 |
oct | 221636770131245 |
9 | 38426376865515 |
10 | 10020022432421 |
11 | 3213516494931 |
12 | 1159b452a4a05 |
13 | 578b65388781 |
14 | 268d863b38a1 |
15 | 12599cb407eb |
hex | 91cf7e0b2a5 |
10020022432421 has 2 divisors, whose sum is σ = 10020022432422. Its totient is φ = 10020022432420.
The previous prime is 10020022432393. The next prime is 10020022432487. The reversal of 10020022432421 is 12423422002001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5511746939521 + 4508275492900 = 2347711^2 + 2123270^2 .
It is a cyclic number.
It is not a de Polignac number, because 10020022432421 - 238 = 9745144525477 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10020022437421) 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, 5010011216210 + 5010011216211.
It is an arithmetic number, because the mean of its divisors is an integer number (5010011216211).
Almost surely, 210020022432421 is an apocalyptic number.
It is an amenable number.
10020022432421 is a deficient number, since it is larger than the sum of its proper divisors (1).
10020022432421 is an equidigital number, since it uses as much as digits as its factorization.
10020022432421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1536, while the sum is 23.
Adding to 10020022432421 its reverse (12423422002001), we get a palindrome (22443444434422).
The spelling of 10020022432421 in words is "ten trillion, twenty billion, twenty-two million, four hundred thirty-two thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •