Base | Representation |
---|---|
bin | 1010000000101010011010… |
… | …01011010110011101101111 |
3 | 2212221102101222021020001211 |
4 | 11000111031023112131233 |
5 | 10341130112031310411 |
6 | 114452344505415251 |
7 | 4431246500353111 |
oct | 500251513263557 |
9 | 85842358236054 |
10 | 22013002213231 |
11 | 7017730965097 |
12 | 2576325a9a527 |
13 | c38a815132b3 |
14 | 5616138913b1 |
15 | 28291e5a1221 |
hex | 14054d2d676f |
22013002213231 has 16 divisors (see below), whose sum is σ = 22660263272448. Its totient is φ = 21368500077600.
The previous prime is 22013002213217. The next prime is 22013002213277. The reversal of 22013002213231 is 13231220031022.
It is a cyclic number.
It is not a de Polignac number, because 22013002213231 - 243 = 13216909191023 is a prime.
It is a super-2 number, since 2×220130022132312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22013002213211) 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 in 15 ways as a sum of consecutive naturals, for example, 459432166 + ... + 459480076.
It is an arithmetic number, because the mean of its divisors is an integer number (1416266454528).
Almost surely, 222013002213231 is an apocalyptic number.
22013002213231 is a deficient number, since it is larger than the sum of its proper divisors (647261059217).
22013002213231 is a wasteful number, since it uses less digits than its factorization.
22013002213231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76422.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 22013002213231 its reverse (13231220031022), we get a palindrome (35244222244253).
The spelling of 22013002213231 in words is "twenty-two trillion, thirteen billion, two million, two hundred thirteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •