Base | Representation |
---|---|
bin | 100001110001100111010… |
… | …0011111111110100100111 |
3 | 121102202220001211021210122 |
4 | 1003203032203333310213 |
5 | 1102023334214111011 |
6 | 13512304053512155 |
7 | 656242556600264 |
oct | 103431643776447 |
9 | 17382801737718 |
10 | 4642030222631 |
11 | 152a74605254a |
12 | 62b7a664265b |
13 | 278984304c59 |
14 | 12096567626b |
15 | 80b3ab923db |
hex | 438ce8ffd27 |
4642030222631 has 4 divisors (see below), whose sum is σ = 4707410930064. Its totient is φ = 4576649515200.
The previous prime is 4642030222567. The next prime is 4642030222637. The reversal of 4642030222631 is 1362220302464.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 4642030222631 - 26 = 4642030222567 is a prime.
It is a super-2 number, since 2×46420302226312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4642030222591 and 4642030222600.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4642030222637) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 32690353610 + ... + 32690353751.
It is an arithmetic number, because the mean of its divisors is an integer number (1176852732516).
Almost surely, 24642030222631 is an apocalyptic number.
4642030222631 is a deficient number, since it is larger than the sum of its proper divisors (65380707433).
4642030222631 is an equidigital number, since it uses as much as digits as its factorization.
4642030222631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65380707432.
The product of its (nonzero) digits is 82944, while the sum is 35.
The spelling of 4642030222631 in words is "four trillion, six hundred forty-two billion, thirty million, two hundred twenty-two thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •