Base | Representation |
---|---|
bin | 100111110000101101111101… |
… | …1001111010101000010110011 |
3 | 1200212100010212000201112001022 |
4 | 1033201123323033111002303 |
5 | 331320143441403402401 |
6 | 3235501522324130055 |
7 | 133445061353256260 |
oct | 11741337317250263 |
9 | 1625303760645038 |
10 | 349743402012851 |
11 | a149138670aa20 |
12 | 3328674583692b |
13 | 1201c879b2a7b2 |
14 | 625195723c267 |
15 | 2a679662ea71b |
hex | 13e16fb3d50b3 |
349743402012851 has 16 divisors (see below), whose sum is σ = 450109648508928. Its totient is φ = 263736122169600.
The previous prime is 349743402012847. The next prime is 349743402012863. The reversal of 349743402012851 is 158210204347943.
It is a cyclic number.
It is not a de Polignac number, because 349743402012851 - 22 = 349743402012847 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 349743402012793 and 349743402012802.
It is not an unprimeable number, because it can be changed into a prime (349743402012451) 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, 73260031550 + ... + 73260036323.
It is an arithmetic number, because the mean of its divisors is an integer number (28131853031808).
Almost surely, 2349743402012851 is an apocalyptic number.
349743402012851 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
349743402012851 is a deficient number, since it is larger than the sum of its proper divisors (100366246496077).
349743402012851 is a wasteful number, since it uses less digits than its factorization.
349743402012851 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 146520067922.
The product of its (nonzero) digits is 5806080, while the sum is 53.
The spelling of 349743402012851 in words is "three hundred forty-nine trillion, seven hundred forty-three billion, four hundred two million, twelve thousand, eight hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •