Base | Representation |
---|---|
bin | 110010100101111000000111… |
… | …1101010001110010110010101 |
3 | 2011100122120122220110102212111 |
4 | 1211023300033222032112111 |
5 | 431312022312013401323 |
6 | 4214242543444151021 |
7 | 162506640625010131 |
oct | 14513601752162625 |
9 | 2140576586412774 |
10 | 445010414200213 |
11 | 119880947466a64 |
12 | 41ab1bbb398471 |
13 | 161403c063ab04 |
14 | 7bc689464c3c1 |
15 | 366ab1e995c0d |
hex | 194bc0fa8e595 |
445010414200213 has 8 divisors (see below), whose sum is σ = 450208545795200. Its totient is φ = 439841901589200.
The previous prime is 445010414200111. The next prime is 445010414200259. The reversal of 445010414200213 is 312002414010544.
It is a happy number.
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 445010414200213 - 217 = 445010414069141 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 (445010414200813) 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, 7404715770 + ... + 7404775867.
It is an arithmetic number, because the mean of its divisors is an integer number (56276068224400).
Almost surely, 2445010414200213 is an apocalyptic number.
It is an amenable number.
445010414200213 is a deficient number, since it is larger than the sum of its proper divisors (5198131594987).
445010414200213 is a wasteful number, since it uses less digits than its factorization.
445010414200213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14809491987.
The product of its (nonzero) digits is 15360, while the sum is 31.
Adding to 445010414200213 its reverse (312002414010544), we get a palindrome (757012828210757).
The spelling of 445010414200213 in words is "four hundred forty-five trillion, ten billion, four hundred fourteen million, two hundred thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •