Base | Representation |
---|---|
bin | 11001111010111101101010… |
… | …111011111011001010000111 |
3 | 112221122120221211012020212120 |
4 | 121322331222323323022013 |
5 | 104420311332411001211 |
6 | 1042244150050021023 |
7 | 33004311240044316 |
oct | 3172755273731207 |
9 | 487576854166776 |
10 | 114003111031431 |
11 | 333634a2138816 |
12 | 10952697277773 |
13 | 4b7c5a778809b |
14 | 2021acc50a27d |
15 | d2a738894d06 |
hex | 67af6aefb287 |
114003111031431 has 8 divisors (see below), whose sum is σ = 154145051535744. Its totient is φ = 74931622274040.
The previous prime is 114003111031427. The next prime is 114003111031477. The reversal of 114003111031431 is 134130111300411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 114003111031431 - 22 = 114003111031427 is a prime.
It is a super-2 number, since 2×1140031110314312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114003111031531) 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, 267612936481 + ... + 267612936906.
It is an arithmetic number, because the mean of its divisors is an integer number (19268131441968).
Almost surely, 2114003111031431 is an apocalyptic number.
114003111031431 is a deficient number, since it is larger than the sum of its proper divisors (40141940504313).
114003111031431 is an equidigital number, since it uses as much as digits as its factorization.
114003111031431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 535225873461.
The product of its (nonzero) digits is 432, while the sum is 24.
Adding to 114003111031431 its reverse (134130111300411), we get a palindrome (248133222331842).
The spelling of 114003111031431 in words is "one hundred fourteen trillion, three billion, one hundred eleven million, thirty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •