Base | Representation |
---|---|
bin | 10100100110000110101… |
… | …110101001011011011000 |
3 | 12000022011000022211021011 |
4 | 110212012232221123120 |
5 | 141142020440200030 |
6 | 3002103145423304 |
7 | 204152365511506 |
oct | 24460656513330 |
9 | 5008130284234 |
10 | 1415304615640 |
11 | 4a6255616573 |
12 | 1aa36679ab34 |
13 | a36025a8866 |
14 | 4c703085676 |
15 | 26c36a95b2a |
hex | 14986ba96d8 |
1415304615640 has 32 divisors (see below), whose sum is σ = 3184696420560. Its totient is φ = 566075440000.
The previous prime is 1415304615619. The next prime is 1415304615643. The reversal of 1415304615640 is 465164035141.
It is a super-3 number, since 3×14153046156403 (a number of 37 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a junction number, because it is equal to n+sod(n) for n = 1415304615593 and 1415304615602.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1415304615643) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 954031 + ... + 1934110.
Almost surely, 21415304615640 is an apocalyptic number.
1415304615640 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1415304615640 is an abundant number, since it is smaller than the sum of its proper divisors (1769391804920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1415304615640 is a wasteful number, since it uses less digits than its factorization.
1415304615640 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2900403 (or 2900399 counting only the distinct ones).
The product of its (nonzero) digits is 172800, while the sum is 40.
The spelling of 1415304615640 in words is "one trillion, four hundred fifteen billion, three hundred four million, six hundred fifteen thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •