Base | Representation |
---|---|
bin | 1101000001101001101001… |
… | …1001000111011011000011 |
3 | 1212201011121120212211112121 |
4 | 3100122122121013123003 |
5 | 3334122434334141011 |
6 | 50243235141305111 |
7 | 3005505534624610 |
oct | 320323231073303 |
9 | 55634546784477 |
10 | 14322011240131 |
11 | 4621a26a75431 |
12 | 1733850705197 |
13 | 7cb73803b9aa |
14 | 377290a39507 |
15 | 19c835baae71 |
hex | d069a6476c3 |
14322011240131 has 16 divisors (see below), whose sum is σ = 16612538793984. Its totient is φ = 12092620186944.
The previous prime is 14322011240113. The next prime is 14322011240167. The reversal of 14322011240131 is 13104211022341.
It is a cyclic number.
It is not a de Polignac number, because 14322011240131 - 27 = 14322011240003 is a prime.
It is a super-2 number, since 2×143220112401312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14322011240096 and 14322011240105.
It is not an unprimeable number, because it can be changed into a prime (14322011240101) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 44141511 + ... + 44464783.
It is an arithmetic number, because the mean of its divisors is an integer number (1038283674624).
Almost surely, 214322011240131 is an apocalyptic number.
14322011240131 is a deficient number, since it is larger than the sum of its proper divisors (2290527553853).
14322011240131 is an equidigital number, since it uses as much as digits as its factorization.
14322011240131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 417810.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 14322011240131 its reverse (13104211022341), we get a palindrome (27426222262472).
The spelling of 14322011240131 in words is "fourteen trillion, three hundred twenty-two billion, eleven million, two hundred forty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •