Base | Representation |
---|---|
bin | 101011000100001… |
… | …0000011101001011 |
3 | 10201201000212101120 |
4 | 1112020100131023 |
5 | 10424410131011 |
6 | 355215250323 |
7 | 50544224643 |
oct | 12610203513 |
9 | 3651025346 |
10 | 1445005131 |
11 | 681738819 |
12 | 343b199a3 |
13 | 1a04a852b |
14 | d9ca9523 |
15 | 86cd4a06 |
hex | 5621074b |
1445005131 has 4 divisors (see below), whose sum is σ = 1926673512. Its totient is φ = 963336752.
The previous prime is 1445005109. The next prime is 1445005181. The reversal of 1445005131 is 1315005441.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1315005441 = 3 ⋅438335147.
It is a cyclic number.
It is not a de Polignac number, because 1445005131 - 29 = 1445004619 is a prime.
It is a super-2 number, since 2×14450051312 = 4176079657232654322, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1445005181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 240834186 + ... + 240834191.
It is an arithmetic number, because the mean of its divisors is an integer number (481668378).
Almost surely, 21445005131 is an apocalyptic number.
1445005131 is a deficient number, since it is larger than the sum of its proper divisors (481668381).
1445005131 is an equidigital number, since it uses as much as digits as its factorization.
1445005131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 481668380.
The product of its (nonzero) digits is 1200, while the sum is 24.
The square root of 1445005131 is about 38013.2231072294. The cubic root of 1445005131 is about 1130.5500574684.
The spelling of 1445005131 in words is "one billion, four hundred forty-five million, five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •