Base | Representation |
---|---|
bin | 1010000000101010101001… |
… | …11110110000110100001110 |
3 | 2212221102202002121112111220 |
4 | 11000111110332300310032 |
5 | 10341130344040143042 |
6 | 114452405503424210 |
7 | 4431252650215455 |
oct | 500252476606416 |
9 | 85842662545456 |
10 | 22013133131022 |
11 | 7017798853610 |
12 | 25763618b5066 |
13 | c38aa2690747 |
14 | 56162700db9c |
15 | 28292ad118ec |
hex | 140554fb0d0e |
22013133131022 has 32 divisors (see below), whose sum is σ = 48098160215424. Its totient is φ = 6660992776800.
The previous prime is 22013133130987. The next prime is 22013133131029.
22013133131022 is nontrivially palindromic in base 10.
It is a junction number, because it is equal to n+sod(n) for n = 22013133130983 and 22013133131001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22013133131029) 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, 241294713 + ... + 241385924.
It is an arithmetic number, because the mean of its divisors is an integer number (1503067506732).
Almost surely, 222013133131022 is an apocalyptic number.
22013133131022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
22013133131022 is an abundant number, since it is smaller than the sum of its proper divisors (26085027084402).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22013133131022 is a wasteful number, since it uses less digits than its factorization.
22013133131022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 482681344.
The product of its (nonzero) digits is 1296, while the sum is 24.
It can be divided in two parts, 2201313 and 3131022, that added together give a palindrome (5332335).
The spelling of 22013133131022 in words is "twenty-two trillion, thirteen billion, one hundred thirty-three million, one hundred thirty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •