Base | Representation |
---|---|
bin | 1110010011000011100111… |
… | …10101100000000010011111 |
3 | 11010022201222121010200102102 |
4 | 13021201303311200002133 |
5 | 13110112340111331143 |
6 | 150511502131315315 |
7 | 6423354603361241 |
oct | 711416365400237 |
9 | 133281877120372 |
10 | 31441104011423 |
11 | a022108601517 |
12 | 36395b614bb3b |
13 | 1470b63a52172 |
14 | 7a9a86a28091 |
15 | 397cc67ea0b8 |
hex | 1c9873d6009f |
31441104011423 has 8 divisors (see below), whose sum is σ = 31963653671568. Its totient is φ = 30921036773184.
The previous prime is 31441104011377. The next prime is 31441104011431. The reversal of 31441104011423 is 32411040114413.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 31441104011423 - 28 = 31441104011167 is a prime.
It is a super-2 number, since 2×314411040114232 (a number of 28 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 (31441104011623) 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, 620579936 + ... + 620630597.
It is an arithmetic number, because the mean of its divisors is an integer number (3995456708946).
Almost surely, 231441104011423 is an apocalyptic number.
31441104011423 is a deficient number, since it is larger than the sum of its proper divisors (522549660145).
31441104011423 is a wasteful number, since it uses less digits than its factorization.
31441104011423 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1241210953.
The product of its (nonzero) digits is 4608, while the sum is 29.
Adding to 31441104011423 its reverse (32411040114413), we get a palindrome (63852144125836).
The spelling of 31441104011423 in words is "thirty-one trillion, four hundred forty-one billion, one hundred four million, eleven thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •