Base | Representation |
---|---|
bin | 10100111000001000110… |
… | …001101111111111010101 |
3 | 12002011010100211010202010 |
4 | 110320020301233333111 |
5 | 142001144040224323 |
6 | 3015024314334433 |
7 | 205436240435445 |
oct | 24701061577725 |
9 | 5064110733663 |
10 | 1434666336213 |
11 | 503490821830 |
12 | 1b206aa2a419 |
13 | a5399974256 |
14 | 4d61c69c125 |
15 | 274bb781c93 |
hex | 14e08c6ffd5 |
1434666336213 has 16 divisors (see below), whose sum is σ = 2086974305856. Its totient is φ = 869416871040.
The previous prime is 1434666336199. The next prime is 1434666336239. The reversal of 1434666336213 is 3126336664341.
It is not a de Polignac number, because 1434666336213 - 29 = 1434666335701 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1434666336283) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1571856 + ... + 2310857.
It is an arithmetic number, because the mean of its divisors is an integer number (130435894116).
Almost surely, 21434666336213 is an apocalyptic number.
It is an amenable number.
1434666336213 is a deficient number, since it is larger than the sum of its proper divisors (652307969643).
1434666336213 is a wasteful number, since it uses less digits than its factorization.
1434666336213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3893924.
The product of its digits is 3359232, while the sum is 48.
The spelling of 1434666336213 in words is "one trillion, four hundred thirty-four billion, six hundred sixty-six million, three hundred thirty-six thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •