Base | Representation |
---|---|
bin | 10111001100010011111100… |
… | …000011001010011100111001 |
3 | 111101011012200212122111212012 |
4 | 113030103330003022130321 |
5 | 101332141234140024311 |
6 | 1000534355230255305 |
7 | 30325223433601262 |
oct | 2714237403123471 |
9 | 441135625574765 |
10 | 102001112033081 |
11 | 2a556479640968 |
12 | b5345ba057535 |
13 | 44bb881bb2051 |
14 | 1b28c47253969 |
15 | bbd43a20d78b |
hex | 5cc4fc0ca739 |
102001112033081 has 2 divisors, whose sum is σ = 102001112033082. Its totient is φ = 102001112033080.
The previous prime is 102001112033059. The next prime is 102001112033209. The reversal of 102001112033081 is 180330211100201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 77815174906681 + 24185937126400 = 8821291^2 + 4917920^2 .
It is a cyclic number.
It is not a de Polignac number, because 102001112033081 - 214 = 102001112016697 is a prime.
It is a super-2 number, since 2×1020011120330812 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (102001112033021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51000556016540 + 51000556016541.
It is an arithmetic number, because the mean of its divisors is an integer number (51000556016541).
Almost surely, 2102001112033081 is an apocalyptic number.
It is an amenable number.
102001112033081 is a deficient number, since it is larger than the sum of its proper divisors (1).
102001112033081 is an equidigital number, since it uses as much as digits as its factorization.
102001112033081 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 23.
Adding to 102001112033081 its reverse (180330211100201), we get a palindrome (282331323133282).
The spelling of 102001112033081 in words is "one hundred two trillion, one billion, one hundred twelve million, thirty-three thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •