Base | Representation |
---|---|
bin | 110010001110010011011… |
… | …101001110001011010001 |
3 | 110012221111022021102202101 |
4 | 302032103131032023101 |
5 | 423021312124242211 |
6 | 11201304220320401 |
7 | 504231145323640 |
oct | 62162335161321 |
9 | 13187438242671 |
10 | 3451332649681 |
11 | 111077a3395a4 |
12 | 478a843a3101 |
13 | 1c05c8037c67 |
14 | bd08c7a9357 |
15 | 5eb9c9c15c1 |
hex | 3239374e2d1 |
3451332649681 has 16 divisors (see below), whose sum is σ = 3951784545280. Its totient is φ = 2952733156560.
The previous prime is 3451332649603. The next prime is 3451332649747. The reversal of 3451332649681 is 1869462331543.
3451332649681 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 3451332649681 - 213 = 3451332641489 is a prime.
It is a super-3 number, since 3×34513326496813 (a number of 39 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3451332641681) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 34512130 + ... + 34611988.
It is an arithmetic number, because the mean of its divisors is an integer number (246986534080).
Almost surely, 23451332649681 is an apocalyptic number.
It is an amenable number.
3451332649681 is a deficient number, since it is larger than the sum of its proper divisors (500451895599).
3451332649681 is an equidigital number, since it uses as much as digits as its factorization.
3451332649681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109084.
The product of its digits is 11197440, while the sum is 55.
The spelling of 3451332649681 in words is "three trillion, four hundred fifty-one billion, three hundred thirty-two million, six hundred forty-nine thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •