Base | Representation |
---|---|
bin | 11110000101001001… |
… | …10010101000111111 |
3 | 1112200110210210002222 |
4 | 33002210302220333 |
5 | 231033211421044 |
6 | 11230252035555 |
7 | 1111124003153 |
oct | 170244625077 |
9 | 45613723088 |
10 | 16149326399 |
11 | 6937967a48 |
12 | 3168462bbb |
13 | 16a49aa64b |
14 | ad2b23063 |
15 | 647b908ee |
hex | 3c2932a3f |
16149326399 has 4 divisors (see below), whose sum is σ = 16149580560. Its totient is φ = 16149072240.
The previous prime is 16149326381. The next prime is 16149326419. The reversal of 16149326399 is 99362394161.
It is a Cunningham number, because it is equal to 1270802-1.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 99362394161 = 613 ⋅162091997.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-16149326399 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 16149326399.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16149326339) 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, 63539 + ... + 190619.
It is an arithmetic number, because the mean of its divisors is an integer number (4037395140).
Almost surely, 216149326399 is an apocalyptic number.
16149326399 is a deficient number, since it is larger than the sum of its proper divisors (254161).
16149326399 is a wasteful number, since it uses less digits than its factorization.
16149326399 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 254160.
The product of its digits is 1889568, while the sum is 53.
The spelling of 16149326399 in words is "sixteen billion, one hundred forty-nine million, three hundred twenty-six thousand, three hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •