Base | Representation |
---|---|
bin | 110101001001000101… |
… | …0111111000100110111 |
3 | 101220120022202000122111 |
4 | 1222102022333010313 |
5 | 3332210101044111 |
6 | 124232055511451 |
7 | 11150015525164 |
oct | 1522212770467 |
9 | 356508660574 |
10 | 114121503031 |
11 | 44442682368 |
12 | 1a14b088587 |
13 | a9b93506b3 |
14 | 574872506b |
15 | 2e7dd6da21 |
hex | 1a922bf137 |
114121503031 has 8 divisors (see below), whose sum is σ = 115413984000. Its totient is φ = 112829249280.
The previous prime is 114121503019. The next prime is 114121503061. The reversal of 114121503031 is 130305121411.
It is a happy number.
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 114121503031 - 27 = 114121502903 is a prime.
It is a super-2 number, since 2×1141215030312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 114121502993 and 114121503011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114121503061) 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, 1081770 + ... + 1182568.
It is an arithmetic number, because the mean of its divisors is an integer number (14426748000).
Almost surely, 2114121503031 is an apocalyptic number.
114121503031 is a deficient number, since it is larger than the sum of its proper divisors (1292480969).
114121503031 is a wasteful number, since it uses less digits than its factorization.
114121503031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 113609.
The product of its (nonzero) digits is 360, while the sum is 22.
Adding to 114121503031 its reverse (130305121411), we get a palindrome (244426624442).
The spelling of 114121503031 in words is "one hundred fourteen billion, one hundred twenty-one million, five hundred three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •