Base | Representation |
---|---|
bin | 100111000011011… |
… | …1110000111100001 |
3 | 10101022211202122120 |
4 | 1032012332013201 |
5 | 10140433401040 |
6 | 334011254453 |
7 | 44321433234 |
oct | 11606760741 |
9 | 3338752576 |
10 | 1310450145 |
11 | 612795654 |
12 | 306a4a429 |
13 | 17b6566b4 |
14 | c608141b |
15 | 7a0a67d0 |
hex | 4e1be1e1 |
1310450145 has 16 divisors (see below), whose sum is σ = 2105498880. Its totient is φ = 695980544.
The previous prime is 1310450123. The next prime is 1310450147. The reversal of 1310450145 is 5410540131.
It is a happy number.
1310450145 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 1310450145 - 26 = 1310450081 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1310450147) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 179184 + ... + 186353.
It is an arithmetic number, because the mean of its divisors is an integer number (131593680).
Almost surely, 21310450145 is an apocalyptic number.
1310450145 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1310450145 is a deficient number, since it is larger than the sum of its proper divisors (795048735).
1310450145 is a wasteful number, since it uses less digits than its factorization.
1310450145 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 365784.
The product of its (nonzero) digits is 1200, while the sum is 24.
The square root of 1310450145 is about 36200.1401240382. The cubic root of 1310450145 is about 1094.3094956467.
Adding to 1310450145 its reverse (5410540131), we get a palindrome (6720990276).
The spelling of 1310450145 in words is "one billion, three hundred ten million, four hundred fifty thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •