Base | Representation |
---|---|
bin | 1001101001101011000111… |
… | …00001000010000101101111 |
3 | 2210010220112112120021210220 |
4 | 10310311203201002011233 |
5 | 10240204403332410411 |
6 | 113045431532302423 |
7 | 4320214164056430 |
oct | 464654341020557 |
9 | 83126475507726 |
10 | 21223103013231 |
11 | 6842738402999 |
12 | 246921a311a13 |
13 | bac43a0b7a72 |
14 | 5352bcc0b487 |
15 | 26c0dce2db06 |
hex | 134d6384216f |
21223103013231 has 128 divisors (see below), whose sum is σ = 34690553856000. Its totient is φ = 11272854758400.
The previous prime is 21223103013209. The next prime is 21223103013251. The reversal of 21223103013231 is 13231030132212.
It is not a de Polignac number, because 21223103013231 - 25 = 21223103013199 is a prime.
It is a super-2 number, since 2×212231030132312 (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 (21223103013251) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 2249873691 + ... + 2249883123.
It is an arithmetic number, because the mean of its divisors is an integer number (271019952000).
Almost surely, 221223103013231 is an apocalyptic number.
21223103013231 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
21223103013231 is a deficient number, since it is larger than the sum of its proper divisors (13467450842769).
21223103013231 is a wasteful number, since it uses less digits than its factorization.
21223103013231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10069.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 21223103013231 its reverse (13231030132212), we get a palindrome (34454133145443).
The spelling of 21223103013231 in words is "twenty-one trillion, two hundred twenty-three billion, one hundred three million, thirteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.259 sec. • engine limits •