Base | Representation |
---|---|
bin | 101000001111101… |
… | …0111110011101101 |
3 | 10111010000111021112 |
4 | 1100133113303231 |
5 | 10231200320021 |
6 | 341555441405 |
7 | 45315135626 |
oct | 12037276355 |
9 | 3433014245 |
10 | 1350401261 |
11 | 6332a2500 |
12 | 3182b6265 |
13 | 186a03c01 |
14 | cb4c0a4d |
15 | 7d848d5b |
hex | 507d7ced |
1350401261 has 24 divisors (see below), whose sum is σ = 1537369344. Its totient is φ = 1184040000.
The previous prime is 1350401249. The next prime is 1350401267. The reversal of 1350401261 is 1621040531.
It is a de Polignac number, because none of the positive numbers 2k-1350401261 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1350401267) 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 23 ways as a sum of consecutive naturals, for example, 1953926 + ... + 1954616.
It is an arithmetic number, because the mean of its divisors is an integer number (64057056).
Almost surely, 21350401261 is an apocalyptic number.
1350401261 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1350401261 is a deficient number, since it is larger than the sum of its proper divisors (186968083).
1350401261 is a wasteful number, since it uses less digits than its factorization.
1350401261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1265 (or 1254 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 23.
The square root of 1350401261 is about 36747.8062066295. The cubic root of 1350401261 is about 1105.3189393496.
Adding to 1350401261 its reverse (1621040531), we get a palindrome (2971441792).
The spelling of 1350401261 in words is "one billion, three hundred fifty million, four hundred one thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •