Base | Representation |
---|---|
bin | 1001100110110001000101… |
… | …11110110011110011101001 |
3 | 2202210100202122021000201110 |
4 | 10303120202332303303221 |
5 | 10232040341412132301 |
6 | 112531514120540533 |
7 | 4310050323646563 |
oct | 463304276636351 |
9 | 82710678230643 |
10 | 21123236052201 |
11 | 6804350084a58 |
12 | 24519a9021749 |
13 | ba2bb301910a |
14 | 5305276dc333 |
15 | 2696e57230d6 |
hex | 133622fb3ce9 |
21123236052201 has 8 divisors (see below), whose sum is σ = 29388850159680. Its totient is φ = 13469889656432.
The previous prime is 21123236052181. The next prime is 21123236052203. The reversal of 21123236052201 is 10225063232112.
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 21123236052201 - 25 = 21123236052169 is a prime.
It is a super-2 number, since 2×211232360522012 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (21123236052203) 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, 153066927846 + ... + 153066927983.
It is an arithmetic number, because the mean of its divisors is an integer number (3673606269960).
Almost surely, 221123236052201 is an apocalyptic number.
It is an amenable number.
21123236052201 is a deficient number, since it is larger than the sum of its proper divisors (8265614107479).
21123236052201 is a wasteful number, since it uses less digits than its factorization.
21123236052201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 306133855855.
The product of its (nonzero) digits is 8640, while the sum is 30.
Adding to 21123236052201 its reverse (10225063232112), we get a palindrome (31348299284313).
The spelling of 21123236052201 in words is "twenty-one trillion, one hundred twenty-three billion, two hundred thirty-six million, fifty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •