Base | Representation |
---|---|
bin | 10011101001101000000… |
… | …010001111111100011000 |
3 | 11210002112021021012212010 |
4 | 103221220002033330120 |
5 | 134111021434313000 |
6 | 2512203231345520 |
7 | 166363210253325 |
oct | 23515002177430 |
9 | 4702467235763 |
10 | 1350365151000 |
11 | 480760a18628 |
12 | 1998626822a0 |
13 | 9a4536c6638 |
14 | 495025abb4c |
15 | 251d5897d50 |
hex | 13a6808ff18 |
1350365151000 has 64 divisors (see below), whose sum is σ = 4213139280480. Its totient is φ = 360097372800.
The previous prime is 1350365150993. The next prime is 1350365151001. The reversal of 1350365151000 is 1515630531.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1350365151001) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 225057859 + ... + 225063858.
Almost surely, 21350365151000 is an apocalyptic number.
1350365151000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1350365151000 is an abundant number, since it is smaller than the sum of its proper divisors (2862774129480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1350365151000 is a wasteful number, since it uses less digits than its factorization.
1350365151000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 450121741 (or 450121727 counting only the distinct ones).
The product of its (nonzero) digits is 6750, while the sum is 30.
The spelling of 1350365151000 in words is "one trillion, three hundred fifty billion, three hundred sixty-five million, one hundred fifty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •