Base | Representation |
---|---|
bin | 10110101111010111000010… |
… | …000110101100000000101001 |
3 | 111010010000100021100110111112 |
4 | 112233113002012230000221 |
5 | 101102042143411123033 |
6 | 552412403032240105 |
7 | 30031411636532153 |
oct | 2657270206540051 |
9 | 433100307313445 |
10 | 100011570020393 |
11 | 29959739a867a9 |
12 | b272ab4540035 |
13 | 43a60871a0565 |
14 | 1a9a82b6a3ad3 |
15 | b867e5408c48 |
hex | 5af5c21ac029 |
100011570020393 has 2 divisors, whose sum is σ = 100011570020394. Its totient is φ = 100011570020392.
The previous prime is 100011570020321. The next prime is 100011570020407. The reversal of 100011570020393 is 393020075110001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 99950466135529 + 61103884864 = 9997523^2 + 247192^2 .
It is a cyclic number.
It is not a de Polignac number, because 100011570020393 - 218 = 100011569758249 is a prime.
It is not a weakly prime, because it can be changed into another prime (100011570320393) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50005785010196 + 50005785010197.
It is an arithmetic number, because the mean of its divisors is an integer number (50005785010197).
Almost surely, 2100011570020393 is an apocalyptic number.
It is an amenable number.
100011570020393 is a deficient number, since it is larger than the sum of its proper divisors (1).
100011570020393 is an equidigital number, since it uses as much as digits as its factorization.
100011570020393 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5670, while the sum is 32.
The spelling of 100011570020393 in words is "one hundred trillion, eleven billion, five hundred seventy million, twenty thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •