Base | Representation |
---|---|
bin | 110000110000010111100110… |
… | …000001100001111000111001 |
3 | 1001010020022120110020121202221 |
4 | 300300113212001201320321 |
5 | 211101210321430212213 |
6 | 2040015454554324041 |
7 | 63111030544455133 |
oct | 6060274601417071 |
9 | 1033208513217687 |
10 | 214430101413433 |
11 | 62362328080814 |
12 | 20071ba7129621 |
13 | 9285896c331a9 |
14 | 3ad4687d3c053 |
15 | 19bcc4434338d |
hex | c305e6061e39 |
214430101413433 has 32 divisors (see below), whose sum is σ = 221632695816192. Its totient is φ = 207305096644800.
The previous prime is 214430101413293. The next prime is 214430101413481. The reversal of 214430101413433 is 334314101034412.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-214430101413433 is a prime.
It is a super-2 number, since 2×2144301014134332 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (214430101413733) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 13683235188 + ... + 13683250858.
It is an arithmetic number, because the mean of its divisors is an integer number (6926021744256).
Almost surely, 2214430101413433 is an apocalyptic number.
It is an amenable number.
214430101413433 is a deficient number, since it is larger than the sum of its proper divisors (7202594402759).
214430101413433 is a wasteful number, since it uses less digits than its factorization.
214430101413433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18685.
The product of its (nonzero) digits is 41472, while the sum is 34.
Adding to 214430101413433 its reverse (334314101034412), we get a palindrome (548744202447845).
The spelling of 214430101413433 in words is "two hundred fourteen trillion, four hundred thirty billion, one hundred one million, four hundred thirteen thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •