Base | Representation |
---|---|
bin | 1110010001111110111011… |
… | …00000100100010100000101 |
3 | 11010012012210020111200211002 |
4 | 13020333131200210110011 |
5 | 13104011321341000031 |
6 | 150442522302223045 |
7 | 6420610621233344 |
oct | 710773540442405 |
9 | 133165706450732 |
10 | 31404222203141 |
11 | a008501800027 |
12 | 3632422584a85 |
13 | 146a5369c6c78 |
14 | 7a7d8862bb5b |
15 | 396d68951ccb |
hex | 1c8fdd824505 |
31404222203141 has 16 divisors (see below), whose sum is σ = 32411272687920. Its totient is φ = 30408739000320.
The previous prime is 31404222203113. The next prime is 31404222203203. The reversal of 31404222203141 is 14130222240413.
It can be written as a sum of positive squares in 8 ways, for example, as 334021578916 + 31070200624225 = 577946^2 + 5574065^2 .
It is a cyclic number.
It is not a de Polignac number, because 31404222203141 - 210 = 31404222202117 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31404222203111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 28607885 + ... + 29685341.
It is an arithmetic number, because the mean of its divisors is an integer number (2025704542995).
Almost surely, 231404222203141 is an apocalyptic number.
It is an amenable number.
31404222203141 is a deficient number, since it is larger than the sum of its proper divisors (1007050484779).
31404222203141 is a wasteful number, since it uses less digits than its factorization.
31404222203141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1082824.
The product of its (nonzero) digits is 9216, while the sum is 29.
Adding to 31404222203141 its reverse (14130222240413), we get a palindrome (45534444443554).
The spelling of 31404222203141 in words is "thirty-one trillion, four hundred four billion, two hundred twenty-two million, two hundred three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •