Base | Representation |
---|---|
bin | 1100110010010010… |
… | …1001111100011011 |
3 | 22212012012211211222 |
4 | 3030210221330123 |
5 | 24012113123201 |
6 | 1324323042255 |
7 | 151023613304 |
oct | 31444517433 |
9 | 8765184758 |
10 | 3432161051 |
11 | 1501402440 |
12 | 7b951038b |
13 | 4290a6637 |
14 | 247b7d7ab |
15 | 1514ab91b |
hex | cc929f1b |
3432161051 has 4 divisors (see below), whose sum is σ = 3744175704. Its totient is φ = 3120146400.
The previous prime is 3432161017. The next prime is 3432161053. The reversal of 3432161051 is 1501612343.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 3432161051 - 218 = 3431898907 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3432161051.
It is not an unprimeable number, because it can be changed into a prime (3432161053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 156007310 + ... + 156007331.
It is an arithmetic number, because the mean of its divisors is an integer number (936043926).
Almost surely, 23432161051 is an apocalyptic number.
3432161051 is a deficient number, since it is larger than the sum of its proper divisors (312014653).
3432161051 is a wasteful number, since it uses less digits than its factorization.
3432161051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 312014652.
The product of its (nonzero) digits is 2160, while the sum is 26.
The square root of 3432161051 is about 58584.6485950031. The cubic root of 3432161051 is about 1508.4209405589.
Adding to 3432161051 its reverse (1501612343), we get a palindrome (4933773394).
The spelling of 3432161051 in words is "three billion, four hundred thirty-two million, one hundred sixty-one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •