Base | Representation |
---|---|
bin | 10111000010100011000111… |
… | …111101110100111111000111 |
3 | 111021210002000111011202202021 |
4 | 113002203013331310333013 |
5 | 101240143244132233111 |
6 | 555302243441024011 |
7 | 30225603252620335 |
oct | 2702430775647707 |
9 | 437702014152667 |
10 | 101330223321031 |
11 | 2a3179a7433831 |
12 | b446586925007 |
13 | 44705259666a3 |
14 | 1b045a2338b55 |
15 | baac71c32d71 |
hex | 5c28c7f74fc7 |
101330223321031 has 2 divisors, whose sum is σ = 101330223321032. Its totient is φ = 101330223321030.
The previous prime is 101330223321007. The next prime is 101330223321149. The reversal of 101330223321031 is 130123322033101.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 101330223321031 - 29 = 101330223320519 is a prime.
It is a super-2 number, since 2×1013302233210312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101330223320987 and 101330223321005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101330223328031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50665111660515 + 50665111660516.
It is an arithmetic number, because the mean of its divisors is an integer number (50665111660516).
Almost surely, 2101330223321031 is an apocalyptic number.
101330223321031 is a deficient number, since it is larger than the sum of its proper divisors (1).
101330223321031 is an equidigital number, since it uses as much as digits as its factorization.
101330223321031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 101330223321031 its reverse (130123322033101), we get a palindrome (231453545354132).
The spelling of 101330223321031 in words is "one hundred one trillion, three hundred thirty billion, two hundred twenty-three million, three hundred twenty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •