Base | Representation |
---|---|
bin | 1101001100110001100000… |
… | …1011000010101101001100 |
3 | 1220101102211220011200222002 |
4 | 3103030120023002231030 |
5 | 3400240312102303121 |
6 | 50511120501411432 |
7 | 3025352101630412 |
oct | 323143013025514 |
9 | 56342756150862 |
10 | 14513100041036 |
11 | 4695a75687883 |
12 | 176489ba09b78 |
13 | 81376c0cca9c |
14 | 38261b41d2b2 |
15 | 1a27bbb44e0b |
hex | d33182c2b4c |
14513100041036 has 12 divisors (see below), whose sum is σ = 25399125670128. Its totient is φ = 7256206992432.
The previous prime is 14513100040991. The next prime is 14513100041051. The reversal of 14513100041036 is 63014000131541.
It is a super-2 number, since 2×145131000410362 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 85661816 + ... + 85831071.
It is an arithmetic number, because the mean of its divisors is an integer number (2116593805844).
Almost surely, 214513100041036 is an apocalyptic number.
It is an amenable number.
14513100041036 is a deficient number, since it is larger than the sum of its proper divisors (10886025629092).
14513100041036 is a wasteful number, since it uses less digits than its factorization.
14513100041036 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 171514048 (or 171514046 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 29.
Adding to 14513100041036 its reverse (63014000131541), we get a palindrome (77527100172577).
The spelling of 14513100041036 in words is "fourteen trillion, five hundred thirteen billion, one hundred million, forty-one thousand, thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •