Base | Representation |
---|---|
bin | 1001110000001010011001… |
… | …1001001110011101000001 |
3 | 1101222010000101201221102211 |
4 | 2130002212121032131001 |
5 | 2401141231140021343 |
6 | 34450031511142121 |
7 | 2154466452063256 |
oct | 234024631163501 |
9 | 41863011657384 |
10 | 10723030001473 |
11 | 346467a983689 |
12 | 1252241074941 |
13 | 5ca23c95a16a |
14 | 290dd6cd142d |
15 | 138de5c8479d |
hex | 9c0a664e741 |
10723030001473 has 8 divisors (see below), whose sum is σ = 10728339831200. Its totient is φ = 10717720577568.
The previous prime is 10723030001423. The next prime is 10723030001483. The reversal of 10723030001473 is 37410003032701.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10723030001473 - 29 = 10723030000961 is a prime.
It is a super-2 number, since 2×107230300014732 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10723030001423) 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 7 ways as a sum of consecutive naturals, for example, 62080213 + ... + 62252701.
It is an arithmetic number, because the mean of its divisors is an integer number (1341042478900).
Almost surely, 210723030001473 is an apocalyptic number.
It is an amenable number.
10723030001473 is a deficient number, since it is larger than the sum of its proper divisors (5309829727).
10723030001473 is a wasteful number, since it uses less digits than its factorization.
10723030001473 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 202911.
The product of its (nonzero) digits is 10584, while the sum is 31.
The spelling of 10723030001473 in words is "ten trillion, seven hundred twenty-three billion, thirty million, one thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •