Base | Representation |
---|---|
bin | 110101000101110110… |
… | …1111001101011000111 |
3 | 101220021202222102222122 |
4 | 1222023231321223013 |
5 | 3331444340343211 |
6 | 124213230520155 |
7 | 11144232224663 |
oct | 1521355715307 |
9 | 356252872878 |
10 | 114013215431 |
11 | 44397540285 |
12 | 1a11a96605b |
13 | a99ca978ab |
14 | 57381b78a3 |
15 | 2e745cd6db |
hex | 1a8bb79ac7 |
114013215431 has 8 divisors (see below), whose sum is σ = 120072126720. Its totient is φ = 107960125752.
The previous prime is 114013215413. The next prime is 114013215443. The reversal of 114013215431 is 134512310411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-114013215431 is a prime.
It is a super-2 number, since 2×1140132154312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 114013215431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114013215401) 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, 1415165 + ... + 1493558.
It is an arithmetic number, because the mean of its divisors is an integer number (15009015840).
Almost surely, 2114013215431 is an apocalyptic number.
114013215431 is a deficient number, since it is larger than the sum of its proper divisors (6058911289).
114013215431 is a wasteful number, since it uses less digits than its factorization.
114013215431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2910805.
The product of its (nonzero) digits is 1440, while the sum is 26.
Adding to 114013215431 its reverse (134512310411), we get a palindrome (248525525842).
The spelling of 114013215431 in words is "one hundred fourteen billion, thirteen million, two hundred fifteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •