Base | Representation |
---|---|
bin | 10000101111001010011… |
… | …111100001101011110101 |
3 | 11001221202011210002001122 |
4 | 100233022133201223311 |
5 | 122321003300430401 |
6 | 2240212341433325 |
7 | 146044606461632 |
oct | 20571237415365 |
9 | 4057664702048 |
10 | 1150153530101 |
11 | 403860757524 |
12 | 166aa810b845 |
13 | 845c75b18c4 |
14 | 3d94c361189 |
15 | 1edb8a7121b |
hex | 10bca7e1af5 |
1150153530101 has 8 divisors (see below), whose sum is σ = 1164067541280. Its totient is φ = 1136240870032.
The previous prime is 1150153530049. The next prime is 1150153530107. The reversal of 1150153530101 is 1010353510511.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1150153530101 - 218 = 1150153267957 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1150153530107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1430711 + ... + 2085003.
It is an arithmetic number, because the mean of its divisors is an integer number (145508442660).
Almost surely, 21150153530101 is an apocalyptic number.
It is an amenable number.
1150153530101 is a deficient number, since it is larger than the sum of its proper divisors (13914011179).
1150153530101 is an equidigital number, since it uses as much as digits as its factorization.
1150153530101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 675555.
The product of its (nonzero) digits is 1125, while the sum is 26.
The spelling of 1150153530101 in words is "one trillion, one hundred fifty billion, one hundred fifty-three million, five hundred thirty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.167 sec. • engine limits •