Base | Representation |
---|---|
bin | 1100110110100011111110… |
… | …1000101111111000010001 |
3 | 1212000221220020021201000000 |
4 | 3031220333220233320101 |
5 | 3323012313033102241 |
6 | 50015532011520213 |
7 | 2655652664342016 |
oct | 315507750577021 |
9 | 55027806251000 |
10 | 14131510050321 |
11 | 455915a019994 |
12 | 1702946159069 |
13 | 7b6798929481 |
14 | 36bd7c2d570d |
15 | 1978d65e3eb6 |
hex | cda3fa2fe11 |
14131510050321 has 56 divisors (see below), whose sum is σ = 22304258856320. Its totient is φ = 8924543667936.
The previous prime is 14131510050271. The next prime is 14131510050337. The reversal of 14131510050321 is 12305001513141.
14131510050321 is a `hidden beast` number, since 1 + 4 + 1 + 3 + 151 + 0 + 0 + 503 + 2 + 1 = 666.
It is not a de Polignac number, because 14131510050321 - 218 = 14131509788177 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14131510050421) by changing a digit.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 277645551 + ... + 277696443.
It is an arithmetic number, because the mean of its divisors is an integer number (398290336720).
Almost surely, 214131510050321 is an apocalyptic number.
It is an amenable number.
14131510050321 is a deficient number, since it is larger than the sum of its proper divisors (8172748805999).
14131510050321 is an equidigital number, since it uses as much as digits as its factorization.
14131510050321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70977 (or 70962 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 27.
Adding to 14131510050321 its reverse (12305001513141), we get a palindrome (26436511563462).
The spelling of 14131510050321 in words is "fourteen trillion, one hundred thirty-one billion, five hundred ten million, fifty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •