Base | Representation |
---|---|
bin | 10101000110011100010… |
… | …110100010000110101001 |
3 | 12010121202212212101020212 |
4 | 111012130112202012221 |
5 | 142224123421200210 |
6 | 3030044441430505 |
7 | 206522011152554 |
oct | 25063426420651 |
9 | 5117685771225 |
10 | 1450027131305 |
11 | 509a53571505 |
12 | 1b503719b435 |
13 | a6977185c0c |
14 | 5027879d69b |
15 | 27aba0b3805 |
hex | 1519c5a21a9 |
1450027131305 has 4 divisors (see below), whose sum is σ = 1740032557572. Its totient is φ = 1160021705040.
The previous prime is 1450027131271. The next prime is 1450027131307. The reversal of 1450027131305 is 5031317200541.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 203899208704 + 1246127922601 = 451552^2 + 1116301^2 .
It is not a de Polignac number, because 1450027131305 - 228 = 1449758695849 is a prime.
It is a super-2 number, since 2×14500271313052 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1450027131307) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 145002713126 + ... + 145002713135.
It is an arithmetic number, because the mean of its divisors is an integer number (435008139393).
Almost surely, 21450027131305 is an apocalyptic number.
It is an amenable number.
1450027131305 is a deficient number, since it is larger than the sum of its proper divisors (290005426267).
1450027131305 is an equidigital number, since it uses as much as digits as its factorization.
1450027131305 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 290005426266.
The product of its (nonzero) digits is 12600, while the sum is 32.
The spelling of 1450027131305 in words is "one trillion, four hundred fifty billion, twenty-seven million, one hundred thirty-one thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •