Base | Representation |
---|---|
bin | 1001010011100010101011… |
… | …0111101000000100110011 |
3 | 1100020002212001221010012000 |
4 | 2110320222313220010303 |
5 | 2320112231304333321 |
6 | 33432113030105043 |
7 | 2104121633222664 |
oct | 224705267500463 |
9 | 40202761833160 |
10 | 10231331324211 |
11 | 32950a0890898 |
12 | 1192a981ab183 |
13 | 592a6c5c439a |
14 | 2752b03b136b |
15 | 12b218d1c826 |
hex | 94e2ade8133 |
10231331324211 has 64 divisors (see below), whose sum is σ = 15873808204800. Its totient is φ = 6500734023168.
The previous prime is 10231331324161. The next prime is 10231331324231. The reversal of 10231331324211 is 11242313313201.
10231331324211 is a `hidden beast` number, since 1 + 0 + 2 + 3 + 1 + 331 + 324 + 2 + 1 + 1 = 666.
It is not a de Polignac number, because 10231331324211 - 219 = 10231330799923 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (10231331324231) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 338804365 + ... + 338834561.
It is an arithmetic number, because the mean of its divisors is an integer number (248028253200).
Almost surely, 210231331324211 is an apocalyptic number.
10231331324211 is a deficient number, since it is larger than the sum of its proper divisors (5642476880589).
10231331324211 is a wasteful number, since it uses less digits than its factorization.
10231331324211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32185 (or 32179 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
Adding to 10231331324211 its reverse (11242313313201), we get a palindrome (21473644637412).
The spelling of 10231331324211 in words is "ten trillion, two hundred thirty-one billion, three hundred thirty-one million, three hundred twenty-four thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •