Base | Representation |
---|---|
bin | 1001011000010011000000… |
… | …0000110111101100111101 |
3 | 1100111220201020101001010102 |
4 | 2112010300000313230331 |
5 | 2322432032113342341 |
6 | 33533423101050445 |
7 | 2113043204504105 |
oct | 226046000675475 |
9 | 40456636331112 |
10 | 10313022012221 |
11 | 331680107a895 |
12 | 11a6896256a25 |
13 | 59a68aa950b6 |
14 | 27921d8ca205 |
15 | 12d3ea950c9b |
hex | 96130037b3d |
10313022012221 has 8 divisors (see below), whose sum is σ = 10329411892800. Its totient is φ = 10296641890080.
The previous prime is 10313022012217. The next prime is 10313022012233. The reversal of 10313022012221 is 12221022031301.
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 10313022012221 - 22 = 10313022012217 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10313022012193 and 10313022012202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10313022012121) 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, 322811 + ... + 4553048.
It is an arithmetic number, because the mean of its divisors is an integer number (1291176486600).
Almost surely, 210313022012221 is an apocalyptic number.
It is an amenable number.
10313022012221 is a deficient number, since it is larger than the sum of its proper divisors (16389880579).
10313022012221 is an equidigital number, since it uses as much as digits as its factorization.
10313022012221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4879219.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 10313022012221 its reverse (12221022031301), we get a palindrome (22534044043522).
The spelling of 10313022012221 in words is "ten trillion, three hundred thirteen billion, twenty-two million, twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •