Base | Representation |
---|---|
bin | 1001101100001101000000… |
… | …10111010110110111110100 |
3 | 2210110012220011021221201012 |
4 | 10312012200113112313310 |
5 | 10243120411421424022 |
6 | 113153404534251352 |
7 | 4326412145541053 |
oct | 466064027266764 |
9 | 83405804257635 |
10 | 21310023233012 |
11 | 6876591622578 |
12 | 24820377b6b58 |
13 | bb76acb41487 |
14 | 5395a6a9639a |
15 | 26e4c8c07de2 |
hex | 1361a05d6df4 |
21310023233012 has 12 divisors (see below), whose sum is σ = 37292875921476. Its totient is φ = 10654915826880.
The previous prime is 21310023232999. The next prime is 21310023233029. The reversal of 21310023233012 is 21033232001312.
It can be written as a sum of positive squares in 2 ways, for example, as 10161329283856 + 11148693949156 = 3187684^2 + 3338966^2 .
It is a super-2 number, since 2×213100232330122 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 23445689 + ... + 24337632.
It is an arithmetic number, because the mean of its divisors is an integer number (3107739660123).
Almost surely, 221310023233012 is an apocalyptic number.
It is an amenable number.
21310023233012 is a deficient number, since it is larger than the sum of its proper divisors (15982852688464).
21310023233012 is a wasteful number, since it uses less digits than its factorization.
21310023233012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47894818 (or 47894816 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 21310023233012 its reverse (21033232001312), we get a palindrome (42343255234324).
The spelling of 21310023233012 in words is "twenty-one trillion, three hundred ten billion, twenty-three million, two hundred thirty-three thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •