Base | Representation |
---|---|
bin | 11101011001010011110… |
… | …01000000000111101001 |
3 | 10120120001001001102022220 |
4 | 32230221321000013221 |
5 | 113022010122414423 |
6 | 2051555152304253 |
7 | 132654145251651 |
oct | 16545171000751 |
9 | 3516031042286 |
10 | 1010020123113 |
11 | 35a390034781 |
12 | 1438b9842089 |
13 | 743241b0481 |
14 | 36c57127361 |
15 | 1b41629b9e3 |
hex | eb29e401e9 |
1010020123113 has 8 divisors (see below), whose sum is σ = 1350246780000. Its totient is φ = 671570107488.
The previous prime is 1010020123087. The next prime is 1010020123117. The reversal of 1010020123113 is 3113210200101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1010020123113 - 28 = 1010020122857 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1010020123092 and 1010020123101.
It is not an unprimeable number, because it can be changed into a prime (1010020123117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 444158988 + ... + 444161261.
It is an arithmetic number, because the mean of its divisors is an integer number (168780847500).
Almost surely, 21010020123113 is an apocalyptic number.
It is an amenable number.
1010020123113 is a deficient number, since it is larger than the sum of its proper divisors (340226656887).
1010020123113 is an equidigital number, since it uses as much as digits as its factorization.
1010020123113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 888320631.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 1010020123113 its reverse (3113210200101), we get a palindrome (4123230323214).
The spelling of 1010020123113 in words is "one trillion, ten billion, twenty million, one hundred twenty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •