Base | Representation |
---|---|
bin | 10011001110100100110… |
… | …100010010011010110100 |
3 | 11200022120001221021201001 |
4 | 103032210310102122310 |
5 | 133122030423131403 |
6 | 2451001152013044 |
7 | 164314354536430 |
oct | 23164464223264 |
9 | 4608501837631 |
10 | 1321320130228 |
11 | 46a40684862a |
12 | 1940b7531184 |
13 | 977a5137807 |
14 | 47d48d119c0 |
15 | 24585a0ac1d |
hex | 133a4d126b4 |
1321320130228 has 24 divisors (see below), whose sum is σ = 2643368263424. Its totient is φ = 566124055200.
The previous prime is 1321320130223. The next prime is 1321320130241. The reversal of 1321320130228 is 8220310231231.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a junction number, because it is equal to n+sod(n) for n = 1321320130196 and 1321320130205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1321320130223) 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 7 ways as a sum of consecutive naturals, for example, 6396543 + ... + 6599878.
Almost surely, 21321320130228 is an apocalyptic number.
It is an amenable number.
1321320130228 is an abundant number, since it is smaller than the sum of its proper divisors (1322048133196).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1321320130228 is a wasteful number, since it uses less digits than its factorization.
1321320130228 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13000063 (or 13000061 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 28.
Adding to 1321320130228 its reverse (8220310231231), we get a palindrome (9541630361459).
The spelling of 1321320130228 in words is "one trillion, three hundred twenty-one billion, three hundred twenty million, one hundred thirty thousand, two hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •