Base | Representation |
---|---|
bin | 10111000010011001110011… |
… | …010011111100111111000011 |
3 | 111021202010011212020000120110 |
4 | 113002121303103330333003 |
5 | 101240012244024414021 |
6 | 555253510251442403 |
7 | 30225100222422501 |
oct | 2702316323747703 |
9 | 437663155200513 |
10 | 101320213123011 |
11 | 2a31372a993903 |
12 | b444652456403 |
13 | 446c5bbb184ac |
14 | 1b03cd2abd671 |
15 | baa88800d476 |
hex | 5c26734fcfc3 |
101320213123011 has 4 divisors (see below), whose sum is σ = 135093617497352. Its totient is φ = 67546808748672.
The previous prime is 101320213122949. The next prime is 101320213123141. The reversal of 101320213123011 is 110321312023101.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 101320213123011 - 241 = 99121189867459 is a prime.
It is a super-2 number, since 2×1013202131230112 (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 (101320213123211) 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, 16886702187166 + ... + 16886702187171.
It is an arithmetic number, because the mean of its divisors is an integer number (33773404374338).
Almost surely, 2101320213123011 is an apocalyptic number.
101320213123011 is a deficient number, since it is larger than the sum of its proper divisors (33773404374341).
101320213123011 is an equidigital number, since it uses as much as digits as its factorization.
101320213123011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33773404374340.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 101320213123011 its reverse (110321312023101), we get a palindrome (211641525146112).
The spelling of 101320213123011 in words is "one hundred one trillion, three hundred twenty billion, two hundred thirteen million, one hundred twenty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •