Base | Representation |
---|---|
bin | 10000000001100101011… |
… | …111111100101000100101 |
3 | 10220021102112100211110120 |
4 | 100001211133330220211 |
5 | 121020241403021123 |
6 | 2201520240312153 |
7 | 142363056550665 |
oct | 20014537745045 |
9 | 3807375324416 |
10 | 1101214501413 |
11 | 395027971974 |
12 | 15950a612659 |
13 | 7cac85a9170 |
14 | 3b4288d01a5 |
15 | 1d9a24032e3 |
hex | 100657fca25 |
1101214501413 has 16 divisors (see below), whose sum is σ = 1582859589696. Its totient is φ = 676972529280.
The previous prime is 1101214501397. The next prime is 1101214501469. The reversal of 1101214501413 is 3141054121011.
It is not a de Polignac number, because 1101214501413 - 24 = 1101214501397 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101214501493) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14501920 + ... + 14577657.
It is an arithmetic number, because the mean of its divisors is an integer number (98928724356).
Almost surely, 21101214501413 is an apocalyptic number.
1101214501413 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1101214501413 is a deficient number, since it is larger than the sum of its proper divisors (481645088283).
1101214501413 is a wasteful number, since it uses less digits than its factorization.
1101214501413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29080564.
The product of its (nonzero) digits is 480, while the sum is 24.
Adding to 1101214501413 its reverse (3141054121011), we get a palindrome (4242268622424).
The spelling of 1101214501413 in words is "one trillion, one hundred one billion, two hundred fourteen million, five hundred one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •