Base | Representation |
---|---|
bin | 1001110000001010011001… |
… | …1001001110011100111111 |
3 | 1101222010000101201221102202 |
4 | 2130002212121032130333 |
5 | 2401141231140021341 |
6 | 34450031511142115 |
7 | 2154466452063254 |
oct | 234024631163477 |
9 | 41863011657382 |
10 | 10723030001471 |
11 | 346467a983687 |
12 | 125224107493b |
13 | 5ca23c95a168 |
14 | 290dd6cd142b |
15 | 138de5c8479b |
hex | 9c0a664e73f |
10723030001471 has 16 divisors (see below), whose sum is σ = 10792346666400. Its totient is φ = 10654002576000.
The previous prime is 10723030001423. The next prime is 10723030001483. The reversal of 10723030001471 is 17410003032701.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 10723030001471 - 218 = 10723029739327 is a prime.
It is a super-3 number, since 3×107230300014713 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10723030003471) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 111802925 + ... + 111898793.
It is an arithmetic number, because the mean of its divisors is an integer number (674521666650).
Almost surely, 210723030001471 is an apocalyptic number.
10723030001471 is a deficient number, since it is larger than the sum of its proper divisors (69316664929).
10723030001471 is an equidigital number, since it uses as much as digits as its factorization.
10723030001471 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97370.
The product of its (nonzero) digits is 3528, while the sum is 29.
The spelling of 10723030001471 in words is "ten trillion, seven hundred twenty-three billion, thirty million, one thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •