Base | Representation |
---|---|
bin | 10100100110001001001… |
… | …110111110000001101010 |
3 | 12000022020221102001000220 |
4 | 110212021032332001222 |
5 | 141142112220034200 |
6 | 3002111250310510 |
7 | 204153415652424 |
oct | 24461116760152 |
9 | 5008227361026 |
10 | 1415346643050 |
11 | 4a627731136a |
12 | 1aa378888436 |
13 | a360b202152 |
14 | 4c7088a5814 |
15 | 26c3a5e84a0 |
hex | 149893be06a |
1415346643050 has 48 divisors (see below), whose sum is σ = 3535311954720. Its totient is φ = 374710472640.
The previous prime is 1415346642893. The next prime is 1415346643093. The reversal of 1415346643050 is 503466435141.
It is a happy number.
It is a super-2 number, since 2×14153466430502 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1415346642993 and 1415346643011.
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 23 ways as a sum of consecutive naturals, for example, 33920317 + ... + 33962016.
It is an arithmetic number, because the mean of its divisors is an integer number (73652332390).
Almost surely, 21415346643050 is an apocalyptic number.
1415346643050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1415346643050 is an abundant number, since it is smaller than the sum of its proper divisors (2119965311670).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1415346643050 is a wasteful number, since it uses less digits than its factorization.
1415346643050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67882487 (or 67882482 counting only the distinct ones).
The product of its (nonzero) digits is 518400, while the sum is 42.
The spelling of 1415346643050 in words is "one trillion, four hundred fifteen billion, three hundred forty-six million, six hundred forty-three thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •