Base | Representation |
---|---|
bin | 10111000010100100111000… |
… | …100011011111001100100011 |
3 | 111021210020220010111212102112 |
4 | 113002210320203133030203 |
5 | 101240211131213211233 |
6 | 555303155115105535 |
7 | 30226001130313046 |
oct | 2702447043371443 |
9 | 437706803455375 |
10 | 101332112241443 |
11 | 2a318786701686 |
12 | b446a134422ab |
13 | 44707670bb185 |
14 | 1b0470115ac5d |
15 | baad329a3048 |
hex | 5c29388df323 |
101332112241443 has 12 divisors (see below), whose sum is σ = 104440002154488. Its totient is φ = 98263496358720.
The previous prime is 101332112241433. The next prime is 101332112241461. The reversal of 101332112241443 is 344142211233101.
It is not a de Polignac number, because 101332112241443 - 234 = 101314932372259 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101332112241433) 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 in 11 ways as a sum of consecutive naturals, for example, 60153638 + ... + 61815243.
It is an arithmetic number, because the mean of its divisors is an integer number (8703333512874).
Almost surely, 2101332112241443 is an apocalyptic number.
101332112241443 is a deficient number, since it is larger than the sum of its proper divisors (3107889913045).
101332112241443 is an equidigital number, since it uses as much as digits as its factorization.
101332112241443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121969202 (or 121969063 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 32.
Adding to 101332112241443 its reverse (344142211233101), we get a palindrome (445474323474544).
The spelling of 101332112241443 in words is "one hundred one trillion, three hundred thirty-two billion, one hundred twelve million, two hundred forty-one thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •