Base | Representation |
---|---|
bin | 110010000010011010111… |
… | …001110001000001110101 |
3 | 110011201120001010100202211 |
4 | 302002122321301001311 |
5 | 422314144100433333 |
6 | 11151354121533421 |
7 | 503300015311120 |
oct | 62023271610165 |
9 | 13151501110684 |
10 | 3438572671093 |
11 | 11063216a184a |
12 | 476503044271 |
13 | 1bc3435c3a81 |
14 | bc5dbc7d3b7 |
15 | 5e6a2681ecd |
hex | 3209ae71075 |
3438572671093 has 8 divisors (see below), whose sum is σ = 4065307591680. Its totient is φ = 2845715313840.
The previous prime is 3438572671081. The next prime is 3438572671141. The reversal of 3438572671093 is 3901762758343.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3438572671093 - 213 = 3438572662901 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3438572671003) 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, 8469390613 + ... + 8469391018.
It is an arithmetic number, because the mean of its divisors is an integer number (508163448960).
It is a 1-persistent number, because it is pandigital, but 2⋅3438572671093 = 6877145342186 is not.
Almost surely, 23438572671093 is an apocalyptic number.
It is an amenable number.
3438572671093 is a deficient number, since it is larger than the sum of its proper divisors (626734920587).
3438572671093 is a wasteful number, since it uses less digits than its factorization.
3438572671093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16938781667.
The product of its (nonzero) digits is 22861440, while the sum is 58.
The spelling of 3438572671093 in words is "three trillion, four hundred thirty-eight billion, five hundred seventy-two million, six hundred seventy-one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •