Base | Representation |
---|---|
bin | 11110101001110000… |
… | …10001011001100101 |
3 | 1120110212122220110122 |
4 | 33110320101121211 |
5 | 232200321014023 |
6 | 11320542131325 |
7 | 1121543200442 |
oct | 172470213145 |
9 | 46425586418 |
10 | 16456423013 |
11 | 6a852491a8 |
12 | 3233280b45 |
13 | 17234c1614 |
14 | b218229c9 |
15 | 664b022c8 |
hex | 3d4e11665 |
16456423013 has 8 divisors (see below), whose sum is σ = 17324334720. Its totient is φ = 15588689760.
The previous prime is 16456422979. The next prime is 16456423043. The reversal of 16456423013 is 31032465461.
16456423013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 16456423013 - 26 = 16456422949 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16456423043) 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 7 ways as a sum of consecutive naturals, for example, 171593 + ... + 249713.
It is an arithmetic number, because the mean of its divisors is an integer number (2165541840).
Almost surely, 216456423013 is an apocalyptic number.
It is an amenable number.
16456423013 is a deficient number, since it is larger than the sum of its proper divisors (867911707).
16456423013 is a wasteful number, since it uses less digits than its factorization.
16456423013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89227.
The product of its (nonzero) digits is 51840, while the sum is 35.
Adding to 16456423013 its reverse (31032465461), we get a palindrome (47488888474).
The spelling of 16456423013 in words is "sixteen billion, four hundred fifty-six million, four hundred twenty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •