Base | Representation |
---|---|
bin | 101011100110101… |
… | …1101001010101101 |
3 | 10202222011110210111 |
4 | 1113031131022231 |
5 | 10444031121013 |
6 | 401104140021 |
7 | 51154346152 |
oct | 12715351255 |
9 | 3688143714 |
10 | 1463145133 |
11 | 6909a865a |
12 | 34a007611 |
13 | 1a418a168 |
14 | dc46c229 |
15 | 886b973d |
hex | 5735d2ad |
1463145133 has 6 divisors (see below), whose sum is σ = 1497964974. Its totient is φ = 1429116696.
The previous prime is 1463145113. The next prime is 1463145181. The reversal of 1463145133 is 3315413641.
It can be written as a sum of positive squares in only one way, i.e., 1348505284 + 114639849 = 36722^2 + 10707^2 .
It is a de Polignac number, because none of the positive numbers 2k-1463145133 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1463145095 and 1463145104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1463145113) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 393810 + ... + 397507.
It is an arithmetic number, because the mean of its divisors is an integer number (249660829).
Almost surely, 21463145133 is an apocalyptic number.
It is an amenable number.
1463145133 is a deficient number, since it is larger than the sum of its proper divisors (34819841).
1463145133 is an frugal number, since it uses more digits than its factorization.
1463145133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 791403 (or 791360 counting only the distinct ones).
The product of its digits is 12960, while the sum is 31.
The square root of 1463145133 is about 38251.0801546832. The cubic root of 1463145133 is about 1135.2612187677.
Adding to 1463145133 its reverse (3315413641), we get a palindrome (4778558774).
The spelling of 1463145133 in words is "one billion, four hundred sixty-three million, one hundred forty-five thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •