Base | Representation |
---|---|
bin | 1100111101000110101… |
… | …01110010111100110101 |
3 | 1120112221022122001200110 |
4 | 12132203111302330311 |
5 | 24243102220001123 |
6 | 540253005533233 |
7 | 44105352561003 |
oct | 6364325627465 |
9 | 1515838561613 |
10 | 445122031413 |
11 | 161858867454 |
12 | 72326574219 |
13 | 32c89907c07 |
14 | 17788b19a73 |
15 | b8a2dde493 |
hex | 67a3572f35 |
445122031413 has 4 divisors (see below), whose sum is σ = 593496041888. Its totient is φ = 296748020940.
The previous prime is 445122031399. The next prime is 445122031439. The reversal of 445122031413 is 314130221544.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 445122031413 - 28 = 445122031157 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 (445122036413) 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 3 ways as a sum of consecutive naturals, for example, 74187005233 + ... + 74187005238.
It is an arithmetic number, because the mean of its divisors is an integer number (148374010472).
Almost surely, 2445122031413 is an apocalyptic number.
It is an amenable number.
445122031413 is a deficient number, since it is larger than the sum of its proper divisors (148374010475).
445122031413 is a wasteful number, since it uses less digits than its factorization.
445122031413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148374010474.
The product of its (nonzero) digits is 11520, while the sum is 30.
Adding to 445122031413 its reverse (314130221544), we get a palindrome (759252252957).
The spelling of 445122031413 in words is "four hundred forty-five billion, one hundred twenty-two million, thirty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •