Base | Representation |
---|---|
bin | 1111101001010000110010… |
… | …10110110001101110011001 |
3 | 11111210220110010110002012012 |
4 | 13310220121112301232121 |
5 | 14002130034020122301 |
6 | 201100323325155305 |
7 | 10150354136205320 |
oct | 764503126615631 |
9 | 144726403402165 |
10 | 34403113442201 |
11 | aa64307718249 |
12 | 3a376790bbb35 |
13 | 16272798c95ba |
14 | 86d1961850b7 |
15 | 3e9d85b7debb |
hex | 1f4a195b1b99 |
34403113442201 has 8 divisors (see below), whose sum is σ = 39389722994880. Its totient is φ = 29434473654768.
The previous prime is 34403113442197. The next prime is 34403113442213. The reversal of 34403113442201 is 10224431130443.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 34403113442201 - 22 = 34403113442197 is a prime.
It is a super-2 number, since 2×344031134422012 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (34403113442221) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4492437206 + ... + 4492444863.
It is an arithmetic number, because the mean of its divisors is an integer number (4923715374360).
Almost surely, 234403113442201 is an apocalyptic number.
It is an amenable number.
34403113442201 is a deficient number, since it is larger than the sum of its proper divisors (4986609552679).
34403113442201 is an equidigital number, since it uses as much as digits as its factorization.
34403113442201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8984882623.
The product of its (nonzero) digits is 27648, while the sum is 32.
Adding to 34403113442201 its reverse (10224431130443), we get a palindrome (44627544572644).
The spelling of 34403113442201 in words is "thirty-four trillion, four hundred three billion, one hundred thirteen million, four hundred forty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •