Base | Representation |
---|---|
bin | 1101110101111100010000… |
… | …10110000001001101001001 |
3 | 10222210002211011110000211122 |
4 | 12322332020112001031021 |
5 | 12442220043444401413 |
6 | 144424135105205025 |
7 | 6261161302465664 |
oct | 672761026011511 |
9 | 128702734400748 |
10 | 30440720700233 |
11 | 977692327a218 |
12 | 34b7747930775 |
13 | 13ca71723928c |
14 | 7734a57226db |
15 | 37bc765ba108 |
hex | 1baf88581349 |
30440720700233 has 6 divisors (see below), whose sum is σ = 30757777849566. Its totient is φ = 30126898828032.
The previous prime is 30440720700197. The next prime is 30440720700253. The reversal of 30440720700233 is 33200702704403.
It can be written as a sum of positive squares in 3 ways, for example, as 3026249910544 + 27414470789689 = 1739612^2 + 5235883^2 .
It is not a de Polignac number, because 30440720700233 - 216 = 30440720634697 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30440720700193 and 30440720700202.
It is not an unprimeable number, because it can be changed into a prime (30440720700253) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1617629060 + ... + 1617647877.
It is an arithmetic number, because the mean of its divisors is an integer number (5126296308261).
Almost surely, 230440720700233 is an apocalyptic number.
It is an amenable number.
30440720700233 is a deficient number, since it is larger than the sum of its proper divisors (317057149333).
30440720700233 is an frugal number, since it uses more digits than its factorization.
30440720700233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3235277131 (or 3235277034 counting only the distinct ones).
The product of its (nonzero) digits is 84672, while the sum is 35.
The spelling of 30440720700233 in words is "thirty trillion, four hundred forty billion, seven hundred twenty million, seven hundred thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •