Base | Representation |
---|---|
bin | 10111000011100111111011… |
… | …100010100110010010100011 |
3 | 111022001010201021220110112220 |
4 | 113003213323202212102203 |
5 | 101242401100334322321 |
6 | 555400222443522123 |
7 | 30234130130111424 |
oct | 2703477342462243 |
9 | 438033637813486 |
10 | 101404103042211 |
11 | 2a346269627842 |
12 | b458964b29343 |
13 | 447749ab0b938 |
14 | 1b07db031564b |
15 | bacb47c5a9c6 |
hex | 5c39fb8a64a3 |
101404103042211 has 8 divisors (see below), whose sum is σ = 135206205430464. Its totient is φ = 67602368007720.
The previous prime is 101404103042191. The next prime is 101404103042261. The reversal of 101404103042211 is 112240301404101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101404103042211 - 219 = 101404102517923 is a prime.
It is a super-2 number, since 2×1014041030422112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (101404103042261) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 91193701 + ... + 92298966.
It is an arithmetic number, because the mean of its divisors is an integer number (16900775678808).
Almost surely, 2101404103042211 is an apocalyptic number.
101404103042211 is a deficient number, since it is larger than the sum of its proper divisors (33802102388253).
101404103042211 is a wasteful number, since it uses less digits than its factorization.
101404103042211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 183676881.
The product of its (nonzero) digits is 768, while the sum is 24.
Adding to 101404103042211 its reverse (112240301404101), we get a palindrome (213644404446312).
The spelling of 101404103042211 in words is "one hundred one trillion, four hundred four billion, one hundred three million, forty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •