Base | Representation |
---|---|
bin | 11001111100011100100110… |
… | …011010000100100100111011 |
3 | 112222000100001110111211221120 |
4 | 121330130212122010210323 |
5 | 104423444110333142111 |
6 | 1042403044300440323 |
7 | 33014550163315353 |
oct | 3174344632044473 |
9 | 488010043454846 |
10 | 114105040521531 |
11 | 333a2748731334 |
12 | 1096a3a32490a3 |
13 | 4b8909cc55237 |
14 | 20269db90db63 |
15 | d2d2021b5406 |
hex | 67c72668493b |
114105040521531 has 8 divisors (see below), whose sum is σ = 152659303361040. Its totient is φ = 75810402348192.
The previous prime is 114105040521491. The next prime is 114105040521559. The reversal of 114105040521531 is 135125040501411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 114105040521531 - 217 = 114105040390459 is a prime.
It is a super-2 number, since 2×1141050405215312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 114105040521492 and 114105040521501.
It is not an unprimeable number, because it can be changed into a prime (114105040522531) 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, 64906165516 + ... + 64906167273.
It is an arithmetic number, because the mean of its divisors is an integer number (19082412920130).
Almost surely, 2114105040521531 is an apocalyptic number.
114105040521531 is a deficient number, since it is larger than the sum of its proper divisors (38554262839509).
114105040521531 is a wasteful number, since it uses less digits than its factorization.
114105040521531 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 129812333085.
The product of its (nonzero) digits is 12000, while the sum is 33.
The spelling of 114105040521531 in words is "one hundred fourteen trillion, one hundred five billion, forty million, five hundred twenty-one thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •