Base | Representation |
---|---|
bin | 10100100100010101010… |
… | …110011001001001100101 |
3 | 12000010020110000212222222 |
4 | 110210111112121021211 |
5 | 141124122010311401 |
6 | 3001150315202125 |
7 | 204054300306062 |
oct | 24442526311145 |
9 | 5003213025888 |
10 | 1413402432101 |
11 | 4a5469909960 |
12 | 1a9b15746345 |
13 | a338b48c17a |
14 | 4c5a25adc69 |
15 | 26b74aa5c1b |
hex | 14915599265 |
1413402432101 has 8 divisors (see below), whose sum is σ = 1570985894304. Its totient is φ = 1260667691920.
The previous prime is 1413402432049. The next prime is 1413402432107. The reversal of 1413402432101 is 1012342043141.
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 1413402432101 - 230 = 1412328690277 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 (1413402432107) 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, 1212179891 + ... + 1212181056.
It is an arithmetic number, because the mean of its divisors is an integer number (196373236788).
Almost surely, 21413402432101 is an apocalyptic number.
1413402432101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1413402432101 is a deficient number, since it is larger than the sum of its proper divisors (157583462203).
1413402432101 is a wasteful number, since it uses less digits than its factorization.
1413402432101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2424361011.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 1413402432101 its reverse (1012342043141), we get a palindrome (2425744475242).
The spelling of 1413402432101 in words is "one trillion, four hundred thirteen billion, four hundred two million, four hundred thirty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •