Base | Representation |
---|---|
bin | 11101011000100000011… |
… | …01010111010000011110 |
3 | 10120111221000021221212010 |
4 | 32230100031113100132 |
5 | 113020114322100100 |
6 | 2051444321252050 |
7 | 132640364026212 |
oct | 16542015272036 |
9 | 3514830257763 |
10 | 1009589253150 |
11 | 35a1898a47a5 |
12 | 1437b9494026 |
13 | 74285b50c2a |
14 | 36c15c08942 |
15 | 1b3dd53b750 |
hex | eb1035741e |
1009589253150 has 48 divisors (see below), whose sum is σ = 2503842422400. Its totient is φ = 269217233760.
The previous prime is 1009589253131. The next prime is 1009589253157. The reversal of 1009589253150 is 513529859001.
It is a self number, because there is not a number n which added to its sum of digits gives 1009589253150.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1009589253157) 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 23 ways as a sum of consecutive naturals, for example, 11846391 + ... + 11931309.
It is an arithmetic number, because the mean of its divisors is an integer number (52163383800).
Almost surely, 21009589253150 is an apocalyptic number.
1009589253150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1009589253150 is an abundant number, since it is smaller than the sum of its proper divisors (1494253169250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1009589253150 is a wasteful number, since it uses less digits than its factorization.
1009589253150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 164193 (or 164188 counting only the distinct ones).
The product of its (nonzero) digits is 486000, while the sum is 48.
The spelling of 1009589253150 in words is "one trillion, nine billion, five hundred eighty-nine million, two hundred fifty-three thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •