Base | Representation |
---|---|
bin | 10100011000010100100… |
… | …011010000011010111001 |
3 | 11221212221112121000010100 |
4 | 110120110203100122321 |
5 | 140421213024000423 |
6 | 2551214355510013 |
7 | 203116540434402 |
oct | 24302443203271 |
9 | 4855845530110 |
10 | 1400504125113 |
11 | 49aa50081a15 |
12 | 1a7515bb8309 |
13 | a20b41a4762 |
14 | 4badb5569a9 |
15 | 2666c540343 |
hex | 146148d06b9 |
1400504125113 has 24 divisors (see below), whose sum is σ = 2198112500480. Its totient is φ = 855995726880.
The previous prime is 1400504125087. The next prime is 1400504125121. The reversal of 1400504125113 is 3115214050041.
1400504125113 is a `hidden beast` number, since 1 + 40 + 0 + 504 + 1 + 2 + 5 + 113 = 666.
It is not a de Polignac number, because 1400504125113 - 230 = 1399430383289 is a prime.
It is a super-2 number, since 2×14005041251132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1400504125613) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 132092806 + ... + 132103407.
Almost surely, 21400504125113 is an apocalyptic number.
It is an amenable number.
1400504125113 is a deficient number, since it is larger than the sum of its proper divisors (797608375367).
1400504125113 is a wasteful number, since it uses less digits than its factorization.
1400504125113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 264196269 (or 264196266 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 27.
Adding to 1400504125113 its reverse (3115214050041), we get a palindrome (4515718175154).
The spelling of 1400504125113 in words is "one trillion, four hundred billion, five hundred four million, one hundred twenty-five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •