Base | Representation |
---|---|
bin | 11110100110110010… |
… | …00010111010100010 |
3 | 1120102010200122122200 |
4 | 33103121002322202 |
5 | 232122423210002 |
6 | 11314251114030 |
7 | 1121121051126 |
oct | 172331027242 |
9 | 46363618580 |
10 | 16431460002 |
11 | 6a72149111 |
12 | 3226a42916 |
13 | 171b2911c9 |
14 | b1c3a5586 |
15 | 662820b1c |
hex | 3d3642ea2 |
16431460002 has 12 divisors (see below), whose sum is σ = 35601496710. Its totient is φ = 5477153328.
The previous prime is 16431459983. The next prime is 16431460009. The reversal of 16431460002 is 20006413461.
16431460002 is a `hidden beast` number, since 1 + 6 + 43 + 14 + 600 + 0 + 2 = 666.
16431460002 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 15331144761 + 1100315241 = 123819^2 + 33171^2 .
It is not an unprimeable number, because it can be changed into a prime (16431460009) 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 5 ways as a sum of consecutive naturals, for example, 456429427 + ... + 456429462.
Almost surely, 216431460002 is an apocalyptic number.
16431460002 is an abundant number, since it is smaller than the sum of its proper divisors (19170036708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16431460002 is a wasteful number, since it uses less digits than its factorization.
16431460002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 912858897 (or 912858894 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 16431460002 its reverse (20006413461), we get a palindrome (36437873463).
The spelling of 16431460002 in words is "sixteen billion, four hundred thirty-one million, four hundred sixty thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •