Base | Representation |
---|---|
bin | 101011111110100101000… |
… | …111111010100001001111 |
3 | 101200220122121010211220210 |
4 | 223332211013322201033 |
5 | 344003311333340211 |
6 | 10232203132013503 |
7 | 431225153624223 |
oct | 53764507724117 |
9 | 11626577124823 |
10 | 3022132324431 |
11 | a65751a016a0 |
12 | 409862001293 |
13 | 18bca7c0266c |
14 | a63b4480783 |
15 | 5392c7ae9a6 |
hex | 2bfa51fa84f |
3022132324431 has 16 divisors (see below), whose sum is σ = 4397177819520. Its totient is φ = 1831033271520.
The previous prime is 3022132324429. The next prime is 3022132324433. The reversal of 3022132324431 is 1344232312203.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (3022132324429) and next prime (3022132324433).
It is not a de Polignac number, because 3022132324431 - 21 = 3022132324429 is a prime.
It is a super-2 number, since 2×30221323244312 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3022132324433) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13942740 + ... + 14157833.
It is an arithmetic number, because the mean of its divisors is an integer number (274823613720).
Almost surely, 23022132324431 is an apocalyptic number.
3022132324431 is a deficient number, since it is larger than the sum of its proper divisors (1375045495089).
3022132324431 is a wasteful number, since it uses less digits than its factorization.
3022132324431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28103846.
The product of its (nonzero) digits is 20736, while the sum is 30.
Adding to 3022132324431 its reverse (1344232312203), we get a palindrome (4366364636634).
The spelling of 3022132324431 in words is "three trillion, twenty-two billion, one hundred thirty-two million, three hundred twenty-four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •