Base | Representation |
---|---|
bin | 11110010001011001101… |
… | …01100001000011010110 |
3 | 10200102202202012201121121 |
4 | 33020230311201003112 |
5 | 114020143340442100 |
6 | 2113455304034154 |
7 | 135101332530313 |
oct | 17105465410326 |
9 | 3612682181547 |
10 | 1040134312150 |
11 | 37113378070a |
12 | 149702a6295a |
13 | 7711311653b |
14 | 384b27b7d0a |
15 | 1c0c9e2e51a |
hex | f22cd610d6 |
1040134312150 has 24 divisors (see below), whose sum is σ = 1979641680984. Its totient is φ = 406378056000.
The previous prime is 1040134312123. The next prime is 1040134312177. The reversal of 1040134312150 is 512134310401.
It is an interprime number because it is at equal distance from previous prime (1040134312123) and next prime (1040134312177).
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
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 11 ways as a sum of consecutive naturals, for example, 241889551 + ... + 241893850.
It is an arithmetic number, because the mean of its divisors is an integer number (82485070041).
Almost surely, 21040134312150 is an apocalyptic number.
1040134312150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1040134312150 is a deficient number, since it is larger than the sum of its proper divisors (939507368834).
1040134312150 is a wasteful number, since it uses less digits than its factorization.
1040134312150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 483783456 (or 483783451 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 25.
Adding to 1040134312150 its reverse (512134310401), we get a palindrome (1552268622551).
The spelling of 1040134312150 in words is "one trillion, forty billion, one hundred thirty-four million, three hundred twelve thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •