Base | Representation |
---|---|
bin | 101110001101010… |
… | …0010010011110001 |
3 | 11000001110112110211 |
4 | 1130122202103301 |
5 | 11133404211040 |
6 | 413503424121 |
7 | 53264456653 |
oct | 13432422361 |
9 | 4001415424 |
10 | 1550460145 |
11 | 726215723 |
12 | 3732b5041 |
13 | 1b92abc50 |
14 | 109cba6d3 |
15 | 911b58ea |
hex | 5c6a24f1 |
1550460145 has 32 divisors (see below), whose sum is σ = 2060704800. Its totient is φ = 1112776704.
The previous prime is 1550460139. The next prime is 1550460151. The reversal of 1550460145 is 5410640551.
It is an interprime number because it is at equal distance from previous prime (1550460139) and next prime (1550460151).
It can be written as a sum of positive squares in 16 ways, for example, as 253956096 + 1296504049 = 15936^2 + 36007^2 .
It is not a de Polignac number, because 1550460145 - 23 = 1550460137 is a prime.
It is a super-2 number, since 2×15504601452 = 4807853322466842050, which contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 373441 + ... + 377569.
It is an arithmetic number, because the mean of its divisors is an integer number (64397025).
Almost surely, 21550460145 is an apocalyptic number.
It is an amenable number.
1550460145 is a deficient number, since it is larger than the sum of its proper divisors (510244655).
1550460145 is a wasteful number, since it uses less digits than its factorization.
1550460145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4309.
The product of its (nonzero) digits is 12000, while the sum is 31.
The square root of 1550460145 is about 39375.8827837548. The cubic root of 1550460145 is about 1157.4090370700.
The spelling of 1550460145 in words is "one billion, five hundred fifty million, four hundred sixty thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •