Base | Representation |
---|---|
bin | 110101001011110010… |
… | …0011001010001101111 |
3 | 101220210122010021210002 |
4 | 1222113210121101233 |
5 | 3332401241100111 |
6 | 124245052334515 |
7 | 11152165256462 |
oct | 1522744312157 |
9 | 356718107702 |
10 | 114212050031 |
11 | 444897a76a2 |
12 | 1a17547443b |
13 | aa020345c1 |
14 | 57567752d9 |
15 | 2e86ca763b |
hex | 1a9791946f |
114212050031 has 8 divisors (see below), whose sum is σ = 117481311024. Its totient is φ = 110952391680.
The previous prime is 114212049989. The next prime is 114212050067. The reversal of 114212050031 is 130050212411.
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 114212050031 - 230 = 113138308207 is a prime.
It is a super-2 number, since 2×1142120500312 (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 = 114212049985 and 114212050012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114212050531) 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, 2376530 + ... + 2424111.
It is an arithmetic number, because the mean of its divisors is an integer number (14685163878).
Almost surely, 2114212050031 is an apocalyptic number.
114212050031 is a deficient number, since it is larger than the sum of its proper divisors (3269260993).
114212050031 is an equidigital number, since it uses as much as digits as its factorization.
114212050031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4801321.
The product of its (nonzero) digits is 240, while the sum is 20.
Adding to 114212050031 its reverse (130050212411), we get a palindrome (244262262442).
The spelling of 114212050031 in words is "one hundred fourteen billion, two hundred twelve million, fifty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •