Base | Representation |
---|---|
bin | 100110110001101… |
… | …0110010110010101 |
3 | 10100200021100102020 |
4 | 1031203112112111 |
5 | 10131041042323 |
6 | 333035203353 |
7 | 44146162032 |
oct | 11543262625 |
9 | 3320240366 |
10 | 1301112213 |
11 | 608497955 |
12 | 3038a6559 |
13 | 1797372ab |
14 | c4b30389 |
15 | 7935eae3 |
hex | 4d8d6595 |
1301112213 has 4 divisors (see below), whose sum is σ = 1734816288. Its totient is φ = 867408140.
The previous prime is 1301112203. The next prime is 1301112217. The reversal of 1301112213 is 3122111031.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1301112213 - 28 = 1301111957 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1301112192 and 1301112201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1301112217) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 216852033 + ... + 216852038.
It is an arithmetic number, because the mean of its divisors is an integer number (433704072).
Almost surely, 21301112213 is an apocalyptic number.
It is an amenable number.
1301112213 is a deficient number, since it is larger than the sum of its proper divisors (433704075).
1301112213 is an equidigital number, since it uses as much as digits as its factorization.
1301112213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 433704074.
The product of its (nonzero) digits is 36, while the sum is 15.
The square root of 1301112213 is about 36070.9330763705. The cubic root of 1301112213 is about 1091.7040408418.
Adding to 1301112213 its reverse (3122111031), we get a palindrome (4423223244).
The spelling of 1301112213 in words is "one billion, three hundred one million, one hundred twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •