Base | Representation |
---|---|
bin | 1100110000001001000100… |
… | …1111111000010011001111 |
3 | 1211122102012020111100021211 |
4 | 3030002101033320103033 |
5 | 3314210414242110411 |
6 | 45453131025235251 |
7 | 2644666441343266 |
oct | 314022117702317 |
9 | 54572166440254 |
10 | 14021210113231 |
11 | 45163a8638692 |
12 | 16a54a2a92b27 |
13 | 7a926b2542c9 |
14 | 3668b73575dd |
15 | 194acd001221 |
hex | cc0913f84cf |
14021210113231 has 4 divisors (see below), whose sum is σ = 14021249493312. Its totient is φ = 14021170733152.
The previous prime is 14021210113223. The next prime is 14021210113243. The reversal of 14021210113231 is 13231101212041.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 14021210113231 - 23 = 14021210113223 is a prime.
It is a super-2 number, since 2×140212101132312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14021210113331) 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, 19151050 + ... + 19869703.
It is an arithmetic number, because the mean of its divisors is an integer number (3505312373328).
Almost surely, 214021210113231 is an apocalyptic number.
14021210113231 is a deficient number, since it is larger than the sum of its proper divisors (39380081).
14021210113231 is an equidigital number, since it uses as much as digits as its factorization.
14021210113231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39380080.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 14021210113231 its reverse (13231101212041), we get a palindrome (27252311325272).
The spelling of 14021210113231 in words is "fourteen trillion, twenty-one billion, two hundred ten million, one hundred thirteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •