Base | Representation |
---|---|
bin | 10011110001101001… |
… | …110000001000100101 |
3 | 2000210211202020011011 |
4 | 103301221300020211 |
5 | 321441413421201 |
6 | 13431012542221 |
7 | 1351126033006 |
oct | 236151601045 |
9 | 60724666134 |
10 | 21234123301 |
11 | 9007122136 |
12 | 4147321971 |
13 | 2005288b01 |
14 | 10561791ad |
15 | 844297151 |
hex | 4f1a70225 |
21234123301 has 8 divisors (see below), whose sum is σ = 21401805944. Its totient is φ = 21066851520.
The previous prime is 21234123299. The next prime is 21234123353. The reversal of 21234123301 is 10332143212.
It can be written as a sum of positive squares in 4 ways, for example, as 6443915076 + 14790208225 = 80274^2 + 121615^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21234123301 - 21 = 21234123299 is a prime.
It is a super-2 number, since 2×212341233012 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21234123101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1471 + ... + 206083.
It is an arithmetic number, because the mean of its divisors is an integer number (2675225743).
Almost surely, 221234123301 is an apocalyptic number.
It is an amenable number.
21234123301 is a deficient number, since it is larger than the sum of its proper divisors (167682643).
21234123301 is a wasteful number, since it uses less digits than its factorization.
21234123301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 205431.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 21234123301 its reverse (10332143212), we get a palindrome (31566266513).
The spelling of 21234123301 in words is "twenty-one billion, two hundred thirty-four million, one hundred twenty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •