Base | Representation |
---|---|
bin | 11110011110011010… |
… | …00001111011111101 |
3 | 1120020020111010222102 |
4 | 33033031001323331 |
5 | 232001431421110 |
6 | 11303301154445 |
7 | 1116305626433 |
oct | 171715017375 |
9 | 46206433872 |
10 | 16361201405 |
11 | 6a3652085a |
12 | 32073bba25 |
13 | 1709861a83 |
14 | b12d16d53 |
15 | 65b5935a5 |
hex | 3cf341efd |
16361201405 has 8 divisors (see below), whose sum is σ = 19635075384. Its totient is φ = 13087872000.
The previous prime is 16361201399. The next prime is 16361201407. The reversal of 16361201405 is 50410216361.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 109286116 + 16251915289 = 10454^2 + 127483^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 16361201405 - 210 = 16361200381 is a prime.
It is a super-2 number, since 2×163612014052 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16361201407) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 66836 + ... + 192845.
It is an arithmetic number, because the mean of its divisors is an integer number (2454384423).
Almost surely, 216361201405 is an apocalyptic number.
It is an amenable number.
16361201405 is a deficient number, since it is larger than the sum of its proper divisors (3273873979).
16361201405 is a wasteful number, since it uses less digits than its factorization.
16361201405 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 272287.
The product of its (nonzero) digits is 4320, while the sum is 29.
Adding to 16361201405 its reverse (50410216361), we get a palindrome (66771417766).
The spelling of 16361201405 in words is "sixteen billion, three hundred sixty-one million, two hundred one thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •