Base | Representation |
---|---|
bin | 1010001011010110110… |
… | …11111010101101100101 |
3 | 1020102121211112000211111 |
4 | 11011223123322231211 |
5 | 21212133334101321 |
6 | 424351513505021 |
7 | 34156523011033 |
oct | 5055333725545 |
9 | 1212554460744 |
10 | 349694831461 |
11 | 125339685748 |
12 | 57934112171 |
13 | 26c8c5b1121 |
14 | 12cd5115553 |
15 | 916a3735e1 |
hex | 516b6fab65 |
349694831461 has 32 divisors (see below), whose sum is σ = 380282462208. Its totient is φ = 320740041600.
The previous prime is 349694831459. The next prime is 349694831483. The reversal of 349694831461 is 164138496943.
It is not a de Polignac number, because 349694831461 - 21 = 349694831459 is a prime.
It is a Smith number, since the sum of its digits (58) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 349694831396 and 349694831405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (349694831441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11901190 + ... + 11930536.
It is an arithmetic number, because the mean of its divisors is an integer number (11883826944).
Almost surely, 2349694831461 is an apocalyptic number.
It is an amenable number.
349694831461 is a deficient number, since it is larger than the sum of its proper divisors (30587630747).
349694831461 is a wasteful number, since it uses less digits than its factorization.
349694831461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29641.
The product of its digits is 13436928, while the sum is 58.
The spelling of 349694831461 in words is "three hundred forty-nine billion, six hundred ninety-four million, eight hundred thirty-one thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •