Base | Representation |
---|---|
bin | 1001000110001101100000… |
… | …1101100110101001101101 |
3 | 1022102012201021100221222222 |
4 | 2101203120031212221231 |
5 | 2302334213143404213 |
6 | 33134555352245125 |
7 | 2051433412222235 |
oct | 221433015465155 |
9 | 38365637327888 |
10 | 10002311309933 |
11 | 3206a57a7a418 |
12 | 11566219a07a5 |
13 | 5772a1c60537 |
14 | 2681860a2cc5 |
15 | 1252b2cea808 |
hex | 918d8366a6d |
10002311309933 has 2 divisors, whose sum is σ = 10002311309934. Its totient is φ = 10002311309932.
The previous prime is 10002311309923. The next prime is 10002311310053. The reversal of 10002311309933 is 33990311320001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8268080432329 + 1734230877604 = 2875427^2 + 1316902^2 .
It is a cyclic number.
It is not a de Polignac number, because 10002311309933 - 26 = 10002311309869 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10002311309893 and 10002311309902.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10002311309923) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5001155654966 + 5001155654967.
It is an arithmetic number, because the mean of its divisors is an integer number (5001155654967).
Almost surely, 210002311309933 is an apocalyptic number.
It is an amenable number.
10002311309933 is a deficient number, since it is larger than the sum of its proper divisors (1).
10002311309933 is an equidigital number, since it uses as much as digits as its factorization.
10002311309933 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13122, while the sum is 35.
Adding to 10002311309933 its reverse (33990311320001), we get a palindrome (43992622629934).
The spelling of 10002311309933 in words is "ten trillion, two billion, three hundred eleven million, three hundred nine thousand, nine hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •