Base | Representation |
---|---|
bin | 10010110100100010… |
… | …11011101101111101 |
3 | 222002012022110002112 |
4 | 21122101123231331 |
5 | 131143220012023 |
6 | 4350353303405 |
7 | 505253304413 |
oct | 113221335575 |
9 | 28065273075 |
10 | 10104454013 |
11 | 4315778945 |
12 | 1b5bb64b65 |
13 | c50530394 |
14 | 6bbd932b3 |
15 | 3e2142478 |
hex | 25a45bb7d |
10104454013 has 4 divisors (see below), whose sum is σ = 10208623740. Its totient is φ = 10000284288.
The previous prime is 10104453959. The next prime is 10104454057. The reversal of 10104454013 is 31045440101.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 6573479929 + 3530974084 = 81077^2 + 59422^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10104454013 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10104454013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10104454513) 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, 52084718 + ... + 52084911.
It is an arithmetic number, because the mean of its divisors is an integer number (2552155935).
Almost surely, 210104454013 is an apocalyptic number.
It is an amenable number.
10104454013 is a deficient number, since it is larger than the sum of its proper divisors (104169727).
10104454013 is an equidigital number, since it uses as much as digits as its factorization.
10104454013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 104169726.
The product of its (nonzero) digits is 960, while the sum is 23.
Adding to 10104454013 its reverse (31045440101), we get a palindrome (41149894114).
The spelling of 10104454013 in words is "ten billion, one hundred four million, four hundred fifty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •