Base | Representation |
---|---|
bin | 10110111111101010101101… |
… | …101000100011100100000011 |
3 | 111021002010220210220100111021 |
4 | 112333222231220203210003 |
5 | 101223422233014311121 |
6 | 555031255225330311 |
7 | 30205363342202356 |
oct | 2677525550434403 |
9 | 437063823810437 |
10 | 101132213041411 |
11 | 2a250a26828a42 |
12 | b414125636997 |
13 | 445795a932966 |
14 | 1ad8b7a5d829d |
15 | ba5a332e0641 |
hex | 5bfaada23903 |
101132213041411 has 4 divisors (see below), whose sum is σ = 101159102758824. Its totient is φ = 101105323324000.
The previous prime is 101132213041361. The next prime is 101132213041417. The reversal of 101132213041411 is 114140312231101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 101132213041411 - 27 = 101132213041283 is a prime.
It is a super-2 number, since 2×1011322130414112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101132213041417) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13444853065 + ... + 13444860586.
It is an arithmetic number, because the mean of its divisors is an integer number (25289775689706).
Almost surely, 2101132213041411 is an apocalyptic number.
101132213041411 is a deficient number, since it is larger than the sum of its proper divisors (26889717413).
101132213041411 is an equidigital number, since it uses as much as digits as its factorization.
101132213041411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26889717412.
The product of its (nonzero) digits is 576, while the sum is 25.
Adding to 101132213041411 its reverse (114140312231101), we get a palindrome (215272525272512).
The spelling of 101132213041411 in words is "one hundred one trillion, one hundred thirty-two billion, two hundred thirteen million, forty-one thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •