Base | Representation |
---|---|
bin | 10001100111001011101… |
… | …100011011100001110001 |
3 | 11021201000010001112100211 |
4 | 101213023230123201301 |
5 | 124312200111411423 |
6 | 2324001114344121 |
7 | 153304304505433 |
oct | 21471354334161 |
9 | 4251003045324 |
10 | 1210303232113 |
11 | 427317692958 |
12 | 17669412b041 |
13 | 8a192065161 |
14 | 42816a62653 |
15 | 217394e510d |
hex | 119cbb1b871 |
1210303232113 has 8 divisors (see below), whose sum is σ = 1218836880360. Its totient is φ = 1201793725440.
The previous prime is 1210303232101. The next prime is 1210303232137. The reversal of 1210303232113 is 3112323030121.
It can be written as a sum of positive squares in 4 ways, for example, as 588078860769 + 622224371344 = 766863^2 + 788812^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1210303232113 - 225 = 1210269677681 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1210303232513) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5934768 + ... + 6135313.
It is an arithmetic number, because the mean of its divisors is an integer number (152354610045).
Almost surely, 21210303232113 is an apocalyptic number.
It is an amenable number.
1210303232113 is a deficient number, since it is larger than the sum of its proper divisors (8533648247).
1210303232113 is a wasteful number, since it uses less digits than its factorization.
1210303232113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12070787.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 1210303232113 its reverse (3112323030121), we get a palindrome (4322626262234).
The spelling of 1210303232113 in words is "one trillion, two hundred ten billion, three hundred three million, two hundred thirty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •