Base | Representation |
---|---|
bin | 10111000010100011001100… |
… | …101011001111010100100011 |
3 | 111021210002012222212001111112 |
4 | 113002203030223033110203 |
5 | 101240143424344143433 |
6 | 555302255342333535 |
7 | 30225605232333503 |
oct | 2702431453172443 |
9 | 437702188761445 |
10 | 101330302334243 |
11 | 2a317a37aa0604 |
12 | b4465a928a2ab |
13 | 447053913c878 |
14 | 1b045aca25a03 |
15 | baac78b3e348 |
hex | 5c28ccacf523 |
101330302334243 has 2 divisors, whose sum is σ = 101330302334244. Its totient is φ = 101330302334242.
The previous prime is 101330302334213. The next prime is 101330302334257. The reversal of 101330302334243 is 342433203033101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101330302334243 - 224 = 101330285557027 is a prime.
It is a super-2 number, since 2×1013303023342432 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (101330302334213) 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, 50665151167121 + 50665151167122.
It is an arithmetic number, because the mean of its divisors is an integer number (50665151167122).
Almost surely, 2101330302334243 is an apocalyptic number.
101330302334243 is a deficient number, since it is larger than the sum of its proper divisors (1).
101330302334243 is an equidigital number, since it uses as much as digits as its factorization.
101330302334243 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 46656, while the sum is 32.
Adding to 101330302334243 its reverse (342433203033101), we get a palindrome (443763505367344).
The spelling of 101330302334243 in words is "one hundred one trillion, three hundred thirty billion, three hundred two million, three hundred thirty-four thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •