Base | Representation |
---|---|
bin | 10110111111011010001010… |
… | …010110110001111100111011 |
3 | 111021000110001021020212010012 |
4 | 112333122022112301330323 |
5 | 101223124333433410021 |
6 | 555015155535412135 |
7 | 30204164055032363 |
oct | 2677321226617473 |
9 | 437013037225105 |
10 | 101114441310011 |
11 | 2a244437087118 |
12 | b4107a598404b |
13 | 4456087aa656c |
14 | 1ad7d7222b9a3 |
15 | ba5342ec735b |
hex | 5bf68a5b1f3b |
101114441310011 has 32 divisors (see below), whose sum is σ = 109534813747200. Its totient is φ = 93053511591040.
The previous prime is 101114441309963. The next prime is 101114441310161. The reversal of 101114441310011 is 110013144411101.
It is a cyclic number.
It is not a de Polignac number, because 101114441310011 - 226 = 101114374201147 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is not an unprimeable number, because it can be changed into a prime (101114441310611) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 237530825 + ... + 237956133.
It is an arithmetic number, because the mean of its divisors is an integer number (3422962929600).
Almost surely, 2101114441310011 is an apocalyptic number.
101114441310011 is a deficient number, since it is larger than the sum of its proper divisors (8420372437189).
101114441310011 is a wasteful number, since it uses less digits than its factorization.
101114441310011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 426619.
The product of its (nonzero) digits is 192, while the sum is 23.
Adding to 101114441310011 its reverse (110013144411101), we get a palindrome (211127585721112).
The spelling of 101114441310011 in words is "one hundred one trillion, one hundred fourteen billion, four hundred forty-one million, three hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •