Base | Representation |
---|---|
bin | 10001101001101100011… |
… | …100001011000110011101 |
3 | 11021221222001200201202212 |
4 | 101221230130023012131 |
5 | 124333211011233201 |
6 | 2325124453530205 |
7 | 153431162514641 |
oct | 21515434130635 |
9 | 4257861621685 |
10 | 1213000102301 |
11 | 428480a31399 |
12 | 177107343965 |
13 | 8a5019c4130 |
14 | 429d0cbcc21 |
15 | 2184615cabb |
hex | 11a6c70b19d |
1213000102301 has 4 divisors (see below), whose sum is σ = 1306307802492. Its totient is φ = 1119692402112.
The previous prime is 1213000102277. The next prime is 1213000102343. The reversal of 1213000102301 is 1032010003121.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 232700112100 + 980299990201 = 482390^2 + 990101^2 .
It is a cyclic number.
It is not a de Polignac number, because 1213000102301 - 214 = 1213000085917 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1213000102381) 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, 46653850076 + ... + 46653850101.
It is an arithmetic number, because the mean of its divisors is an integer number (326576950623).
Almost surely, 21213000102301 is an apocalyptic number.
It is an amenable number.
1213000102301 is a deficient number, since it is larger than the sum of its proper divisors (93307700191).
1213000102301 is an equidigital number, since it uses as much as digits as its factorization.
1213000102301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 93307700190.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 1213000102301 its reverse (1032010003121), we get a palindrome (2245010105422).
The spelling of 1213000102301 in words is "one trillion, two hundred thirteen billion, one hundred two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.824 sec. • engine limits •