Base | Representation |
---|---|
bin | 10101101100011101110… |
… | …010111010011101000001 |
3 | 12021112011010221201001221 |
4 | 111230131302322131001 |
5 | 143411232001200401 |
6 | 3100515541155041 |
7 | 212465511660301 |
oct | 25543562723501 |
9 | 5245133851057 |
10 | 1490853537601 |
11 | 5252a3a5685a |
12 | 200b2b9bba81 |
13 | aa78250568c |
14 | 5222ca0b601 |
15 | 28ba93db7a1 |
hex | 15b1dcba741 |
1490853537601 has 4 divisors (see below), whose sum is σ = 1491134995332. Its totient is φ = 1490572079872.
The previous prime is 1490853537599. The next prime is 1490853537647. The reversal of 1490853537601 is 1067353580941.
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 435436335376 + 1055417202225 = 659876^2 + 1027335^2 .
It is a cyclic number.
It is not a de Polignac number, because 1490853537601 - 21 = 1490853537599 is a prime.
It is a super-3 number, since 3×14908535376013 (a number of 37 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1490553537601) 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, 140720920 + ... + 140731513.
It is an arithmetic number, because the mean of its divisors is an integer number (372783748833).
Almost surely, 21490853537601 is an apocalyptic number.
It is an amenable number.
1490853537601 is a deficient number, since it is larger than the sum of its proper divisors (281457731).
1490853537601 is an equidigital number, since it uses as much as digits as its factorization.
1490853537601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 281457730.
The product of its (nonzero) digits is 2721600, while the sum is 52.
The spelling of 1490853537601 in words is "one trillion, four hundred ninety billion, eight hundred fifty-three million, five hundred thirty-seven thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •