Base | Representation |
---|---|
bin | 101111111110110001100011… |
… | …011110100011010100001001 |
3 | 1000200011111200011012021110122 |
4 | 233332301203132203110021 |
5 | 210124341030021443200 |
6 | 2024450100335153025 |
7 | 62306556634563140 |
oct | 5776614336432411 |
9 | 1020144604167418 |
10 | 211022002140425 |
11 | 61268a2396aa93 |
12 | 1b801589675775 |
13 | 909939bb04228 |
14 | 3a1773b336757 |
15 | 195e27714b385 |
hex | bfec637a3509 |
211022002140425 has 48 divisors (see below), whose sum is σ = 310587512555520. Its totient is φ = 139221686775360.
The previous prime is 211022002140359. The next prime is 211022002140431. The reversal of 211022002140425 is 524041200220112.
It is not a de Polignac number, because 211022002140425 - 216 = 211022002074889 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 211022002140394 and 211022002140403.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 216939899 + ... + 217910448.
It is an arithmetic number, because the mean of its divisors is an integer number (6470573178240).
Almost surely, 2211022002140425 is an apocalyptic number.
211022002140425 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
211022002140425 is a deficient number, since it is larger than the sum of its proper divisors (99565510415095).
211022002140425 is a wasteful number, since it uses less digits than its factorization.
211022002140425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 434850470 (or 434850465 counting only the distinct ones).
The product of its (nonzero) digits is 2560, while the sum is 26.
Adding to 211022002140425 its reverse (524041200220112), we get a palindrome (735063202360537).
The spelling of 211022002140425 in words is "two hundred eleven trillion, twenty-two billion, two million, one hundred forty thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •