Base | Representation |
---|---|
bin | 1001000110001101100011… |
… | …0010111101100010100101 |
3 | 1022102012201221210111120122 |
4 | 2101203120302331202211 |
5 | 2302334223200244023 |
6 | 33135000342211325 |
7 | 2051433561400421 |
oct | 221433062754245 |
9 | 38365657714518 |
10 | 10002321103013 |
11 | 3206a62559078 |
12 | 1156625123b45 |
13 | 5772a3cabb65 |
14 | 2681874d1b81 |
15 | 1252b3ad22c8 |
hex | 918d8cbd8a5 |
10002321103013 has 16 divisors (see below), whose sum is σ = 10851201075456. Its totient is φ = 9182479541760.
The previous prime is 10002321102967. The next prime is 10002321103031. The reversal of 10002321103013 is 31030112320001.
It is a cyclic number.
It is not a de Polignac number, because 10002321103013 - 222 = 10002316908709 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10002321102982 and 10002321103000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10002321103213) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1993670 + ... + 4896872.
It is an arithmetic number, because the mean of its divisors is an integer number (678200067216).
Almost surely, 210002321103013 is an apocalyptic number.
It is an amenable number.
10002321103013 is a deficient number, since it is larger than the sum of its proper divisors (848879972443).
10002321103013 is a wasteful number, since it uses less digits than its factorization.
10002321103013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2908204.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 10002321103013 its reverse (31030112320001), we get a palindrome (41032433423014).
The spelling of 10002321103013 in words is "ten trillion, two billion, three hundred twenty-one million, one hundred three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •