Base | Representation |
---|---|
bin | 1001000110010001010010… |
… | …0010000111101010111111 |
3 | 1022102022022210122110020012 |
4 | 2101210110202013222333 |
5 | 2302343301232233043 |
6 | 33135244023213435 |
7 | 2051500451200004 |
oct | 221442442075277 |
9 | 38368283573205 |
10 | 10003323321023 |
11 | 320742725731a |
12 | 11568648a727b |
13 | 577403814776 |
14 | 2682406598ab |
15 | 125321aa0a18 |
hex | 91914887abf |
10003323321023 has 4 divisors (see below), whose sum is σ = 10043177199048. Its totient is φ = 9963469443000.
The previous prime is 10003323321011. The next prime is 10003323321133. The reversal of 10003323321023 is 32012332330001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10003323321023 - 230 = 10002249579199 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 10003323321023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10003323321323) 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, 19926938636 + ... + 19926939137.
It is an arithmetic number, because the mean of its divisors is an integer number (2510794299762).
Almost surely, 210003323321023 is an apocalyptic number.
10003323321023 is a deficient number, since it is larger than the sum of its proper divisors (39853878025).
10003323321023 is an equidigital number, since it uses as much as digits as its factorization.
10003323321023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39853878024.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 10003323321023 its reverse (32012332330001), we get a palindrome (42015655651024).
The spelling of 10003323321023 in words is "ten trillion, three billion, three hundred twenty-three million, three hundred twenty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •