Base | Representation |
---|---|
bin | 1001111001100011111110… |
… | …00111001010101000100001 |
3 | 2212002002122220120011201212 |
4 | 10330301333013022220201 |
5 | 10323130431332403441 |
6 | 114144315230435505 |
7 | 4404521531044130 |
oct | 474617707125041 |
9 | 85062586504655 |
10 | 21769026841121 |
11 | 6a33213152a5a |
12 | 2536b97062b95 |
13 | c1ba6c663ba1 |
14 | 5538ab25d917 |
15 | 27b3e0636eeb |
hex | 13cc7f1caa21 |
21769026841121 has 16 divisors (see below), whose sum is σ = 25068185376000. Its totient is φ = 18517674783168.
The previous prime is 21769026841061. The next prime is 21769026841151. The reversal of 21769026841121 is 12114862096712.
It is a cyclic number.
It is not a de Polignac number, because 21769026841121 - 210 = 21769026840097 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 21769026841121.
It is not an unprimeable number, because it can be changed into a prime (21769026841151) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 19544810 + ... + 20628563.
It is an arithmetic number, because the mean of its divisors is an integer number (1566761586000).
Almost surely, 221769026841121 is an apocalyptic number.
It is an amenable number.
21769026841121 is a deficient number, since it is larger than the sum of its proper divisors (3299158534879).
21769026841121 is a wasteful number, since it uses less digits than its factorization.
21769026841121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40173968.
The product of its (nonzero) digits is 580608, while the sum is 50.
The spelling of 21769026841121 in words is "twenty-one trillion, seven hundred sixty-nine billion, twenty-six million, eight hundred forty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •