Base | Representation |
---|---|
bin | 1001011000110001011110… |
… | …1001010010000101010100 |
3 | 1100112200211101112212210022 |
4 | 2112030113221102011110 |
5 | 2323100310444011403 |
6 | 33541254550244312 |
7 | 2113453014624563 |
oct | 226142751220524 |
9 | 40480741485708 |
10 | 10321203110228 |
11 | 331a21a09a90a |
12 | 11a839a056698 |
13 | 59b3929a4aaa |
14 | 279798255bda |
15 | 12d728cbed38 |
hex | 96317a52154 |
10321203110228 has 12 divisors (see below), whose sum is σ = 18137679107520. Its totient is φ = 5139009079512.
The previous prime is 10321203110227. The next prime is 10321203110263. The reversal of 10321203110228 is 82201130212301.
It is a junction number, because it is equal to n+sod(n) for n = 10321203110197 and 10321203110206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10321203110227) 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 3 ways as a sum of consecutive naturals, for example, 5398117826 + ... + 5398119737.
It is an arithmetic number, because the mean of its divisors is an integer number (1511473258960).
Almost surely, 210321203110228 is an apocalyptic number.
It is an amenable number.
10321203110228 is a deficient number, since it is larger than the sum of its proper divisors (7816475997292).
10321203110228 is a wasteful number, since it uses less digits than its factorization.
10321203110228 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10796237806 (or 10796237804 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 26.
Adding to 10321203110228 its reverse (82201130212301), we get a palindrome (92522333322529).
The spelling of 10321203110228 in words is "ten trillion, three hundred twenty-one billion, two hundred three million, one hundred ten thousand, two hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •