Base | Representation |
---|---|
bin | 1011000111011011101111… |
… | …0000100011000011110111 |
3 | 1121021102222100000002201222 |
4 | 2301312323300203003313 |
5 | 3100222313444214111 |
6 | 41554510052540555 |
7 | 2401014532020254 |
oct | 261667360430367 |
9 | 47242870002658 |
10 | 12222332023031 |
11 | 3992509878489 |
12 | 145492a32175b |
13 | 6a873a591570 |
14 | 3037c798c42b |
15 | 162de6c0a7db |
hex | b1dbbc230f7 |
12222332023031 has 4 divisors (see below), whose sum is σ = 13162511409432. Its totient is φ = 11282152636632.
The previous prime is 12222332022983. The next prime is 12222332023039. The reversal of 12222332023031 is 13032023322221.
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 12222332023031 - 230 = 12221258281207 is a prime.
It is a super-2 number, since 2×122223320230312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12222332023039) 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, 470089693181 + ... + 470089693206.
It is an arithmetic number, because the mean of its divisors is an integer number (3290627852358).
Almost surely, 212222332023031 is an apocalyptic number.
12222332023031 is a deficient number, since it is larger than the sum of its proper divisors (940179386401).
12222332023031 is an equidigital number, since it uses as much as digits as its factorization.
12222332023031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 940179386400.
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 12222332023031 its reverse (13032023322221), we get a palindrome (25254355345252).
The spelling of 12222332023031 in words is "twelve trillion, two hundred twenty-two billion, three hundred thirty-two million, twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •