Base | Representation |
---|---|
bin | 100011110011010… |
… | …1001010110111101 |
3 | 10002201111000220222 |
4 | 1013212221112331 |
5 | 4430014010323 |
6 | 315112151125 |
7 | 41524664612 |
oct | 10746512675 |
9 | 3081430828 |
10 | 1201313213 |
11 | 567123441 |
12 | 2963984a5 |
13 | 161b64129 |
14 | b5792509 |
15 | 706e99c8 |
hex | 479a95bd |
1201313213 has 6 divisors (see below), whose sum is σ = 1208094174. Its totient is φ = 1194570104.
The previous prime is 1201313203. The next prime is 1201313221. The reversal of 1201313213 is 3123131021.
It can be written as a sum of positive squares in only one way, i.e., 893591449 + 307721764 = 29893^2 + 17542^2 .
It is a de Polignac number, because none of the positive numbers 2k-1201313213 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1201313191 and 1201313200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1201313203) 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, 13295 + ... + 50787.
It is an arithmetic number, because the mean of its divisors is an integer number (201349029).
Almost surely, 21201313213 is an apocalyptic number.
It is an amenable number.
1201313213 is a deficient number, since it is larger than the sum of its proper divisors (6780961).
1201313213 is an frugal number, since it uses more digits than its factorization.
1201313213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37851 (or 37672 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 17.
The square root of 1201313213 is about 34659.9655654763. The cubic root of 1201313213 is about 1063.0460659341.
Adding to 1201313213 its reverse (3123131021), we get a palindrome (4324444234).
The spelling of 1201313213 in words is "one billion, two hundred one million, three hundred thirteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •