Base | Representation |
---|---|
bin | 10011101001101011000… |
… | …100001110110010110110 |
3 | 11210002122210221201122000 |
4 | 103221223010032302312 |
5 | 134111122444032410 |
6 | 2512212245320130 |
7 | 166364365424541 |
oct | 23515304166266 |
9 | 4702583851560 |
10 | 1350416002230 |
11 | 48078769a939 |
12 | 199877706046 |
13 | 9a4610bc319 |
14 | 49509247858 |
15 | 251da08edc0 |
hex | 13a6b10ecb6 |
1350416002230 has 64 divisors (see below), whose sum is σ = 3698436646080. Its totient is φ = 350378203392.
The previous prime is 1350416002163. The next prime is 1350416002277. The reversal of 1350416002230 is 322006140531.
1350416002230 is a `hidden beast` number, since 1 + 3 + 5 + 0 + 4 + 1 + 600 + 22 + 30 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1350416002194 and 1350416002203.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 67578399 + ... + 67598378.
It is an arithmetic number, because the mean of its divisors is an integer number (57788072595).
Almost surely, 21350416002230 is an apocalyptic number.
1350416002230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1350416002230 is an abundant number, since it is smaller than the sum of its proper divisors (2348020643850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1350416002230 is a wasteful number, since it uses less digits than its factorization.
1350416002230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135176830 (or 135176824 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 27.
The spelling of 1350416002230 in words is "one trillion, three hundred fifty billion, four hundred sixteen million, two thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •