Base | Representation |
---|---|
bin | 110101011001101101… |
… | …1011100010001111001 |
3 | 101222000012122102200121 |
4 | 1222303123130101321 |
5 | 3334330420340311 |
6 | 124403310533241 |
7 | 11166602240536 |
oct | 1526333342171 |
9 | 358005572617 |
10 | 114679465081 |
11 | 446a9628525 |
12 | 1a285b07221 |
13 | aa77b1ac5c |
14 | 579c887d8d |
15 | 2eb2d35b71 |
hex | 1ab36dc479 |
114679465081 has 4 divisors (see below), whose sum is σ = 115255744000. Its totient is φ = 114103186164.
The previous prime is 114679465063. The next prime is 114679465139. The reversal of 114679465081 is 180564976411.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 180564976411 = 59 ⋅3060423329.
It is a cyclic number.
It is not a de Polignac number, because 114679465081 - 215 = 114679432313 is a prime.
It is a super-2 number, since 2×1146794650812 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (114679465001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 288139161 + ... + 288139558.
It is an arithmetic number, because the mean of its divisors is an integer number (28813936000).
Almost surely, 2114679465081 is an apocalyptic number.
It is an amenable number.
114679465081 is a deficient number, since it is larger than the sum of its proper divisors (576278919).
114679465081 is an equidigital number, since it uses as much as digits as its factorization.
114679465081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 576278918.
The product of its (nonzero) digits is 1451520, while the sum is 52.
The spelling of 114679465081 in words is "one hundred fourteen billion, six hundred seventy-nine million, four hundred sixty-five thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •