Base | Representation |
---|---|
bin | 1101000000001000… |
… | …0010101101101011 |
3 | 100000020102100021210 |
4 | 3100002002231223 |
5 | 24121442240311 |
6 | 1334155004203 |
7 | 152330115336 |
oct | 32002025553 |
9 | 10006370253 |
10 | 3490196331 |
11 | 1531141186 |
12 | 814a39663 |
13 | 43811623b |
14 | 25176961d |
15 | 1566223a6 |
hex | d0082b6b |
3490196331 has 16 divisors (see below), whose sum is σ = 4674656160. Its totient is φ = 2316288000.
The previous prime is 3490196327. The next prime is 3490196363. The reversal of 3490196331 is 1336910943.
It is not a de Polignac number, because 3490196331 - 22 = 3490196327 is a prime.
It is a super-2 number, since 2×34901963312 = 24362940857851723122, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 3490196331.
It is not an unprimeable number, because it can be changed into a prime (3490196531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 870331 + ... + 874331.
It is an arithmetic number, because the mean of its divisors is an integer number (292166010).
Almost surely, 23490196331 is an apocalyptic number.
3490196331 is a deficient number, since it is larger than the sum of its proper divisors (1184459829).
3490196331 is a wasteful number, since it uses less digits than its factorization.
3490196331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5246.
The product of its (nonzero) digits is 52488, while the sum is 39.
The square root of 3490196331 is about 59077.8836029186. The cubic root of 3490196331 is about 1516.8755548916.
The spelling of 3490196331 in words is "three billion, four hundred ninety million, one hundred ninety-six thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •