Base | Representation |
---|---|
bin | 10000000000111100001011… |
… | …110101110100010100010001 |
3 | 100020101100211110201212021211 |
4 | 100000330023311310110101 |
5 | 33212440014020010101 |
6 | 405444350421420121 |
7 | 20556433334211355 |
oct | 2000741365642421 |
9 | 306340743655254 |
10 | 70433367344401 |
11 | 20495694743206 |
12 | 7a9656026a641 |
13 | 303bab823b2c9 |
14 | 1356dc937d465 |
15 | 82220096ec51 |
hex | 400f0bd74511 |
70433367344401 has 16 divisors (see below), whose sum is σ = 74789152959888. Its totient is φ = 66101216051200.
The previous prime is 70433367344371. The next prime is 70433367344447. The reversal of 70433367344401 is 10444376333407.
It can be written as a sum of positive squares in 8 ways, for example, as 5967643151376 + 64465724193025 = 2442876^2 + 8029055^2 .
It is a cyclic number.
It is not a de Polignac number, because 70433367344401 - 231 = 70431219860753 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (70433367348401) 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 15 ways as a sum of consecutive naturals, for example, 628134621 + ... + 628246741.
It is an arithmetic number, because the mean of its divisors is an integer number (4674322059993).
Almost surely, 270433367344401 is an apocalyptic number.
It is an amenable number.
70433367344401 is a deficient number, since it is larger than the sum of its proper divisors (4355785615487).
70433367344401 is a wasteful number, since it uses less digits than its factorization.
70433367344401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 217172.
The product of its (nonzero) digits is 6096384, while the sum is 49.
The spelling of 70433367344401 in words is "seventy trillion, four hundred thirty-three billion, three hundred sixty-seven million, three hundred forty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •