Base | Representation |
---|---|
bin | 1001100110111110010000… |
… | …00010000001011001011001 |
3 | 2202211000222221111221122010 |
4 | 10303133020002001121121 |
5 | 10232144323311232413 |
6 | 112535043104020133 |
7 | 4310420351251620 |
oct | 463371002013131 |
9 | 82730887457563 |
10 | 21130300102233 |
11 | 68073455a6333 |
12 | 245323a901649 |
13 | ba376a68958a |
14 | 5309d796c6b7 |
15 | 2699aa98edc3 |
hex | 1337c8081659 |
21130300102233 has 64 divisors (see below), whose sum is σ = 34011898970112. Its totient is φ = 11413597861440.
The previous prime is 21130300102229. The next prime is 21130300102271. The reversal of 21130300102233 is 33220100303112.
It is not a de Polignac number, because 21130300102233 - 22 = 21130300102229 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (21130300102283) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 14703810 + ... + 16076772.
It is an arithmetic number, because the mean of its divisors is an integer number (531435921408).
Almost surely, 221130300102233 is an apocalyptic number.
It is an amenable number.
21130300102233 is a deficient number, since it is larger than the sum of its proper divisors (12881598867879).
21130300102233 is a wasteful number, since it uses less digits than its factorization.
21130300102233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1373554.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 21130300102233 its reverse (33220100303112), we get a palindrome (54350400405345).
The spelling of 21130300102233 in words is "twenty-one trillion, one hundred thirty billion, three hundred million, one hundred two thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •