Base | Representation |
---|---|
bin | 10111000010010010100011… |
… | …000011100111101001101101 |
3 | 111021201101002001000101211122 |
4 | 113002102203003213221231 |
5 | 101234400321044304401 |
6 | 555250141332230325 |
7 | 30224403213656363 |
oct | 2702224303475155 |
9 | 437641061011748 |
10 | 101312424213101 |
11 | 2a3103a3293582 |
12 | b443039a6b3a5 |
13 | 446b94a24346a |
14 | 1b03794483633 |
15 | baa57e30d21b |
hex | 5c24a30e7a6d |
101312424213101 has 8 divisors (see below), whose sum is σ = 101377626387840. Its totient is φ = 101247225644448.
The previous prime is 101312424213073. The next prime is 101312424213263.
It is a happy number.
101312424213101 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101312424213101 - 214 = 101312424196717 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101312424213401) 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 7 ways as a sum of consecutive naturals, for example, 56480060 + ... + 58246218.
It is an arithmetic number, because the mean of its divisors is an integer number (12672203298480).
Almost surely, 2101312424213101 is an apocalyptic number.
It is an amenable number.
101312424213101 is a deficient number, since it is larger than the sum of its proper divisors (65202174739).
101312424213101 is a wasteful number, since it uses less digits than its factorization.
101312424213101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1803043.
The product of its (nonzero) digits is 1152, while the sum is 26.
The spelling of 101312424213101 in words is "one hundred one trillion, three hundred twelve billion, four hundred twenty-four million, two hundred thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •