Base | Representation |
---|---|
bin | 101011010111110… |
… | …0101000011101111 |
3 | 10202102102120022111 |
4 | 1112233211003233 |
5 | 10440030010020 |
6 | 400224224451 |
7 | 51030646303 |
oct | 12657450357 |
9 | 3672376274 |
10 | 1455313135 |
11 | 687539331 |
12 | 34746b127 |
13 | 1a2677343 |
14 | db3cdd03 |
15 | 87b6dd5a |
hex | 56be50ef |
1455313135 has 16 divisors (see below), whose sum is σ = 1908755712. Its totient is φ = 1060416000.
The previous prime is 1455313133. The next prime is 1455313157. The reversal of 1455313135 is 5313135541.
It is not a de Polignac number, because 1455313135 - 21 = 1455313133 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1455313097 and 1455313106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1455313133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 273516 + ... + 278785.
It is an arithmetic number, because the mean of its divisors is an integer number (119297232).
Almost surely, 21455313135 is an apocalyptic number.
1455313135 is a deficient number, since it is larger than the sum of its proper divisors (453442577).
1455313135 is a wasteful number, since it uses less digits than its factorization.
1455313135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 552354.
The product of its digits is 13500, while the sum is 31.
The square root of 1455313135 is about 38148.5666178954. The cubic root of 1455313135 is about 1133.2319656069.
Adding to 1455313135 its reverse (5313135541), we get a palindrome (6768448676).
The spelling of 1455313135 in words is "one billion, four hundred fifty-five million, three hundred thirteen thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •