Base | Representation |
---|---|
bin | 11110000101001000… |
… | …01110000001011101 |
3 | 1112200110112011100221 |
4 | 33002210032001131 |
5 | 231033142121123 |
6 | 11230244521341 |
7 | 1111122506656 |
oct | 170244160135 |
9 | 45613464327 |
10 | 16149176413 |
11 | 6937875297 |
12 | 31683b0251 |
13 | 16a49572b6 |
14 | ad2ac452d |
15 | 647b6125d |
hex | 3c290e05d |
16149176413 has 4 divisors (see below), whose sum is σ = 16151815708. Its totient is φ = 16146537120.
The previous prime is 16149176411. The next prime is 16149176423. The reversal of 16149176413 is 31467194161.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 31467194161 = 13 ⋅2420553397.
It can be written as a sum of positive squares in 2 ways, for example, as 12693852889 + 3455323524 = 112667^2 + 58782^2 .
It is a cyclic number.
It is not a de Polignac number, because 16149176413 - 21 = 16149176411 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 16149176413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16149176411) 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, 1310448 + ... + 1322713.
It is an arithmetic number, because the mean of its divisors is an integer number (4037953927).
Almost surely, 216149176413 is an apocalyptic number.
It is an amenable number.
16149176413 is a deficient number, since it is larger than the sum of its proper divisors (2639295).
16149176413 is an equidigital number, since it uses as much as digits as its factorization.
16149176413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2639294.
The product of its digits is 108864, while the sum is 43.
The spelling of 16149176413 in words is "sixteen billion, one hundred forty-nine million, one hundred seventy-six thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •