Base | Representation |
---|---|
bin | 11110100110111000… |
… | …11010100000010001 |
3 | 1120102012100111222102 |
4 | 33103130122200101 |
5 | 232123134434212 |
6 | 11314322050145 |
7 | 1121131416464 |
oct | 172334324021 |
9 | 46365314872 |
10 | 16432343057 |
11 | 6a726a1609 |
12 | 32271a9955 |
13 | 171b510120 |
14 | b1c5552db |
15 | 6629475c2 |
hex | 3d371a811 |
16432343057 has 4 divisors (see below), whose sum is σ = 17696369460. Its totient is φ = 15168316656.
The previous prime is 16432343027. The next prime is 16432343093. The reversal of 16432343057 is 75034323461.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 5629650961 + 10802692096 = 75031^2 + 103936^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-16432343057 is a prime.
It is a super-2 number, since 2×164323430572 (a number of 21 digits) contains 22 as substring.
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 16432343057.
It is not an unprimeable number, because it can be changed into a prime (16432343027) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 632013182 + ... + 632013207.
It is an arithmetic number, because the mean of its divisors is an integer number (4424092365).
Almost surely, 216432343057 is an apocalyptic number.
It is an amenable number.
16432343057 is a deficient number, since it is larger than the sum of its proper divisors (1264026403).
16432343057 is a wasteful number, since it uses less digits than its factorization.
16432343057 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1264026402.
The product of its (nonzero) digits is 181440, while the sum is 38.
The spelling of 16432343057 in words is "sixteen billion, four hundred thirty-two million, three hundred forty-three thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.031 sec. • engine limits •