Base | Representation |
---|---|
bin | 110000111011101… |
… | …0110110101100101 |
3 | 11020102112020022110 |
4 | 1201313112311211 |
5 | 11330311321123 |
6 | 430531351233 |
7 | 55454634405 |
oct | 14167266545 |
9 | 4212466273 |
10 | 1641901413 |
11 | 7728a0919 |
12 | 399a52519 |
13 | 202216bc9 |
14 | 1180c0805 |
15 | 99229493 |
hex | 61dd6d65 |
1641901413 has 8 divisors (see below), whose sum is σ = 2208575808. Its totient is φ = 1084913984.
The previous prime is 1641901409. The next prime is 1641901421. The reversal of 1641901413 is 3141091461.
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 1641901413 - 22 = 1641901409 is a prime.
It is a super-3 number, since 3×16419014133 (a number of 29 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1641901403) 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, 2421345 + ... + 2422022.
It is an arithmetic number, because the mean of its divisors is an integer number (276071976).
Almost surely, 21641901413 is an apocalyptic number.
It is an amenable number.
1641901413 is a deficient number, since it is larger than the sum of its proper divisors (566674395).
1641901413 is a wasteful number, since it uses less digits than its factorization.
1641901413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4843483.
The product of its (nonzero) digits is 2592, while the sum is 30.
The square root of 1641901413 is about 40520.3826857546. The cubic root of 1641901413 is about 1179.7292812358.
Adding to 1641901413 its reverse (3141091461), we get a palindrome (4782992874).
The spelling of 1641901413 in words is "one billion, six hundred forty-one million, nine hundred one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •