Base | Representation |
---|---|
bin | 1001001100011110110011… |
… | …0100000010011011111101 |
3 | 1022210111202110011212202021 |
4 | 2103013230310002123331 |
5 | 2311120320431040213 |
6 | 33300252325400141 |
7 | 2062265665354144 |
oct | 223075464023375 |
9 | 38714673155667 |
10 | 10110031111933 |
11 | 3248704aa3a75 |
12 | 1173484b69051 |
13 | 5844aac2954c |
14 | 26d4844d075b |
15 | 127eb9b33d8d |
hex | 931ecd026fd |
10110031111933 has 2 divisors, whose sum is σ = 10110031111934. Its totient is φ = 10110031111932.
The previous prime is 10110031111919. The next prime is 10110031111979. The reversal of 10110031111933 is 33911113001101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8184880411929 + 1925150700004 = 2860923^2 + 1387498^2 .
It is a cyclic number.
It is not a de Polignac number, because 10110031111933 - 29 = 10110031111421 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10110031111898 and 10110031111907.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10110091111933) by changing a digit.
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 as a sum of consecutive naturals, namely, 5055015555966 + 5055015555967.
It is an arithmetic number, because the mean of its divisors is an integer number (5055015555967).
Almost surely, 210110031111933 is an apocalyptic number.
It is an amenable number.
10110031111933 is a deficient number, since it is larger than the sum of its proper divisors (1).
10110031111933 is an equidigital number, since it uses as much as digits as its factorization.
10110031111933 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 243, while the sum is 25.
The spelling of 10110031111933 in words is "ten trillion, one hundred ten billion, thirty-one million, one hundred eleven thousand, nine hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •