Base | Representation |
---|---|
bin | 110010101110100111110100… |
… | …0110111001110100010110111 |
3 | 2011111220111002011111201102101 |
4 | 1211131033220313032202313 |
5 | 431441220400124442333 |
6 | 4221003043044322531 |
7 | 162662531050641250 |
oct | 14535175067164267 |
9 | 2144814064451371 |
10 | 446212354140343 |
11 | 11a1a46621a885a |
12 | 42066b3a6a3447 |
13 | 161c984bb0188b |
14 | 7c28b16679b27 |
15 | 368c019b2d67d |
hex | 195d3e8dce8b7 |
446212354140343 has 16 divisors (see below), whose sum is σ = 526453792921600. Its totient is φ = 370097303536800.
The previous prime is 446212354140247. The next prime is 446212354140347. The reversal of 446212354140343 is 343041453212644.
It is a de Polignac number, because none of the positive numbers 2k-446212354140343 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 446212354140293 and 446212354140302.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (446212354140347) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 88541928 + ... + 93445693.
It is an arithmetic number, because the mean of its divisors is an integer number (32903362057600).
Almost surely, 2446212354140343 is an apocalyptic number.
446212354140343 is a deficient number, since it is larger than the sum of its proper divisors (80241438781257).
446212354140343 is a wasteful number, since it uses less digits than its factorization.
446212354140343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 181998958.
The product of its (nonzero) digits is 3317760, while the sum is 46.
The spelling of 446212354140343 in words is "four hundred forty-six trillion, two hundred twelve billion, three hundred fifty-four million, one hundred forty thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •