Base | Representation |
---|---|
bin | 1001011000001011110101… |
… | …1101011001100111000110 |
3 | 1100111201202021222100200220 |
4 | 2112002331131121213012 |
5 | 2322414113112030202 |
6 | 33532504244045210 |
7 | 2112644446560324 |
oct | 226027535314706 |
9 | 40451667870626 |
10 | 10311100111302 |
11 | 3315a05226221 |
12 | 11a643a693806 |
13 | 59a442863b13 |
14 | 2790ba560d14 |
15 | 12d336d68abc |
hex | 960bd7599c6 |
10311100111302 has 32 divisors (see below), whose sum is σ = 20646811599840. Its totient is φ = 3432933542400.
The previous prime is 10311100111283. The next prime is 10311100111331. The reversal of 10311100111302 is 20311100111301.
It is a super-3 number, since 3×103111001113023 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19841008 + ... + 20354060.
It is an arithmetic number, because the mean of its divisors is an integer number (645212862495).
Almost surely, 210311100111302 is an apocalyptic number.
10311100111302 is an abundant number, since it is smaller than the sum of its proper divisors (10335711488538).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10311100111302 is a wasteful number, since it uses less digits than its factorization.
10311100111302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 517048.
The product of its (nonzero) digits is 18, while the sum is 15.
Adding to 10311100111302 its reverse (20311100111301), we get a palindrome (30622200222603).
Subtracting 10311100111302 from its reverse (20311100111301), we obtain a palindrome (9999999999999).
The spelling of 10311100111302 in words is "ten trillion, three hundred eleven billion, one hundred million, one hundred eleven thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •