Base | Representation |
---|---|
bin | 1001011000001011100011… |
… | …0000011101000101110011 |
3 | 1100111201112210112021110122 |
4 | 2112002320300131011303 |
5 | 2322413432413021321 |
6 | 33532452345120455 |
7 | 2112642501163205 |
oct | 226027060350563 |
9 | 40451483467418 |
10 | 10311021220211 |
11 | 3315974742178 |
12 | 11a641818912b |
13 | 59a42c4013ba |
14 | 2790adca6775 |
15 | 12d32ee838ab |
hex | 960b8c1d173 |
10311021220211 has 8 divisors (see below), whose sum is σ = 10550114266560. Its totient is φ = 10074072506472.
The previous prime is 10311021220183. The next prime is 10311021220231. The reversal of 10311021220211 is 11202212011301.
It is a happy number.
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 10311021220211 - 214 = 10311021203827 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10311021220211.
It is not an unprimeable number, because it can be changed into a prime (10311021220231) 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, 536073425 + ... + 536092658.
It is an arithmetic number, because the mean of its divisors is an integer number (1318764283320).
Almost surely, 210311021220211 is an apocalyptic number.
10311021220211 is a deficient number, since it is larger than the sum of its proper divisors (239093046349).
10311021220211 is a wasteful number, since it uses less digits than its factorization.
10311021220211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1072166305.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 10311021220211 its reverse (11202212011301), we get a palindrome (21513233231512).
The spelling of 10311021220211 in words is "ten trillion, three hundred eleven billion, twenty-one million, two hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •