Base | Representation |
---|---|
bin | 1010000000101011000000… |
… | …01100010011111110101111 |
3 | 2212221110020012120001222000 |
4 | 11000111200030103332233 |
5 | 10341131240213413203 |
6 | 114452440303223343 |
7 | 4431260423104632 |
oct | 500254014237657 |
9 | 85843205501860 |
10 | 22013321232303 |
11 | 7017884a49915 |
12 | 25763b48a7b53 |
13 | c38b0263cb8b |
14 | 561643db5c19 |
15 | 28293c5ba4a3 |
hex | 140560313faf |
22013321232303 has 32 divisors (see below), whose sum is σ = 34557242569920. Its totient is φ = 13801662950400.
The previous prime is 22013321232299. The next prime is 22013321232313. The reversal of 22013321232303 is 30323212331022.
22013321232303 is a `hidden beast` number, since 2 + 2 + 0 + 1 + 3 + 321 + 2 + 32 + 303 = 666.
It is not a de Polignac number, because 22013321232303 - 22 = 22013321232299 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22013321232313) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 17834550 + ... + 19028867.
It is an arithmetic number, because the mean of its divisors is an integer number (1079913830310).
Almost surely, 222013321232303 is an apocalyptic number.
22013321232303 is a deficient number, since it is larger than the sum of its proper divisors (12543921337617).
22013321232303 is a wasteful number, since it uses less digits than its factorization.
22013321232303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36864744 (or 36864738 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 27.
Adding to 22013321232303 its reverse (30323212331022), we get a palindrome (52336533563325).
The spelling of 22013321232303 in words is "twenty-two trillion, thirteen billion, three hundred twenty-one million, two hundred thirty-two thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •