Base | Representation |
---|---|
bin | 1110010001111011011011… |
… | …00000110100101111100011 |
3 | 11010012000221021212120120222 |
4 | 13020331231200310233203 |
5 | 13103443444331102433 |
6 | 150442012021153255 |
7 | 6420513224166050 |
oct | 710755540645743 |
9 | 133160837776528 |
10 | 31402343222243 |
11 | a007728100954 |
12 | 3631b9925b82b |
13 | 146a2c7642656 |
14 | 7a7c4ac76027 |
15 | 396ca89e6b98 |
hex | 1c8f6d834be3 |
31402343222243 has 8 divisors (see below), whose sum is σ = 35912990204160. Its totient is φ = 26897845727880.
The previous prime is 31402343222221. The next prime is 31402343222267. The reversal of 31402343222243 is 34222234320413.
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 31402343222243 - 28 = 31402343221987 is a prime.
It is a super-2 number, since 2×314023432222432 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (31402343222203) 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, 1537360943 + ... + 1537381368.
It is an arithmetic number, because the mean of its divisors is an integer number (4489123775520).
Almost surely, 231402343222243 is an apocalyptic number.
31402343222243 is a deficient number, since it is larger than the sum of its proper divisors (4510646981917).
31402343222243 is a wasteful number, since it uses less digits than its factorization.
31402343222243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3074743777.
The product of its (nonzero) digits is 165888, while the sum is 35.
Adding to 31402343222243 its reverse (34222234320413), we get a palindrome (65624577542656).
The spelling of 31402343222243 in words is "thirty-one trillion, four hundred two billion, three hundred forty-three million, two hundred twenty-two thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •