Base | Representation |
---|---|
bin | 10011011000111110… |
… | …00101000010010101 |
3 | 222212111021212012211 |
4 | 21230133011002111 |
5 | 132304431133023 |
6 | 4440550513421 |
7 | 515653501330 |
oct | 115437050225 |
9 | 28774255184 |
10 | 10410021013 |
11 | 4462204957 |
12 | 2026365871 |
13 | c9b92a062 |
14 | 70a7b5617 |
15 | 40dda0a0d |
hex | 26c7c5095 |
10410021013 has 4 divisors (see below), whose sum is σ = 11897166880. Its totient is φ = 8922875148.
The previous prime is 10410021001. The next prime is 10410021029. The reversal of 10410021013 is 31012001401.
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 10410021013 - 25 = 10410020981 is a prime.
It is a super-2 number, since 2×104100210132 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10410020984 and 10410021002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10410021113) 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, 743572923 + ... + 743572936.
It is an arithmetic number, because the mean of its divisors is an integer number (2974291720).
Almost surely, 210410021013 is an apocalyptic number.
It is an amenable number.
10410021013 is a deficient number, since it is larger than the sum of its proper divisors (1487145867).
10410021013 is an equidigital number, since it uses as much as digits as its factorization.
10410021013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1487145866.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 10410021013 its reverse (31012001401), we get a palindrome (41422022414).
The spelling of 10410021013 in words is "ten billion, four hundred ten million, twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •