Base | Representation |
---|---|
bin | 101111001000101011… |
… | …1001101110011111101 |
3 | 100200021101222201000121 |
4 | 1132101113031303331 |
5 | 3124301043430023 |
6 | 114300132454541 |
7 | 10212254362450 |
oct | 1362127156375 |
9 | 320241881017 |
10 | 101223030013 |
11 | 39a23841706 |
12 | 1774b47a451 |
13 | 9712008541 |
14 | 4c83667497 |
15 | 29767c3d5d |
hex | 17915cdcfd |
101223030013 has 8 divisors (see below), whose sum is σ = 115687268928. Its totient is φ = 86759742624.
The previous prime is 101223029993. The next prime is 101223030017. The reversal of 101223030013 is 310030322101.
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 101223030013 - 213 = 101223021821 is a prime.
It is a super-2 number, since 2×1012230300132 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101223030017) 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, 6870 + ... + 449992.
It is an arithmetic number, because the mean of its divisors is an integer number (14460908616).
Almost surely, 2101223030013 is an apocalyptic number.
It is an amenable number.
101223030013 is a deficient number, since it is larger than the sum of its proper divisors (14464238915).
101223030013 is an equidigital number, since it uses as much as digits as its factorization.
101223030013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 475763.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 101223030013 its reverse (310030322101), we get a palindrome (411253352114).
The spelling of 101223030013 in words is "one hundred one billion, two hundred twenty-three million, thirty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •