Base | Representation |
---|---|
bin | 10011000011101000… |
… | …01111100111101101 |
3 | 222102000110200000011 |
4 | 21201310033213231 |
5 | 131423120120023 |
6 | 4411114133221 |
7 | 511351143454 |
oct | 114164174755 |
9 | 28360420004 |
10 | 10231020013 |
11 | 4380164845 |
12 | 1b96421211 |
13 | c70815ac6 |
14 | 6d0adbb9b |
15 | 3ed2e350d |
hex | 261d0f9ed |
10231020013 has 4 divisors (see below), whose sum is σ = 10231293600. Its totient is φ = 10230746428.
The previous prime is 10231019969. The next prime is 10231020029. The reversal of 10231020013 is 31002013201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10231020013 - 225 = 10197465581 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10231019975 and 10231020002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10231020073) 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 3 ways as a sum of consecutive naturals, for example, 69745 + ... + 159142.
It is an arithmetic number, because the mean of its divisors is an integer number (2557823400).
Almost surely, 210231020013 is an apocalyptic number.
It is an amenable number.
10231020013 is a deficient number, since it is larger than the sum of its proper divisors (273587).
10231020013 is an equidigital number, since it uses as much as digits as its factorization.
10231020013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 273586.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 10231020013 its reverse (31002013201), we get a palindrome (41233033214).
The spelling of 10231020013 in words is "ten billion, two hundred thirty-one million, twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •