Base | Representation |
---|---|
bin | 1101100111010101101100… |
… | …1010001101010101010001 |
3 | 1222000001212112012121020021 |
4 | 3121311123022031111101 |
5 | 3430230004022214030 |
6 | 51500520003343441 |
7 | 3103336633132561 |
oct | 331653312152521 |
9 | 58001775177207 |
10 | 14969490429265 |
11 | 4851586103509 |
12 | 1819230081b81 |
13 | 847803401248 |
14 | 39a754902da1 |
15 | 1ae5cde3197a |
hex | d9d5b28d551 |
14969490429265 has 16 divisors (see below), whose sum is σ = 19483962296400. Its totient is φ = 10996239738880.
The previous prime is 14969490429259. The next prime is 14969490429307. The reversal of 14969490429265 is 56292409496941.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 3099529260304 + 11869961168961 = 1760548^2 + 3445281^2 .
It is not a de Polignac number, because 14969490429265 - 217 = 14969490298193 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14969490429194 and 14969490429203.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2147699590 + ... + 2147706559.
It is an arithmetic number, because the mean of its divisors is an integer number (1217747643525).
Almost surely, 214969490429265 is an apocalyptic number.
It is an amenable number.
14969490429265 is a deficient number, since it is larger than the sum of its proper divisors (4514471867135).
14969490429265 is a wasteful number, since it uses less digits than its factorization.
14969490429265 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4295406212.
The product of its (nonzero) digits is 302330880, while the sum is 70.
The spelling of 14969490429265 in words is "fourteen trillion, nine hundred sixty-nine billion, four hundred ninety million, four hundred twenty-nine thousand, two hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •