Base | Representation |
---|---|
bin | 10000101010101111111… |
… | …100000011001010101110 |
3 | 11001111111210201222221022 |
4 | 100222233330003022232 |
5 | 122231301220231100 |
6 | 2234110120534142 |
7 | 145516255220150 |
oct | 20525774031256 |
9 | 4044453658838 |
10 | 1145413055150 |
11 | 401848899531 |
12 | 165ba4621352 |
13 | 8402044c040 |
14 | 3d61c938ad0 |
15 | 1ebdc7d0e85 |
hex | 10aaff032ae |
1145413055150 has 48 divisors (see below), whose sum is σ = 2622114819744. Its totient is φ = 362504350080.
The previous prime is 1145413055123. The next prime is 1145413055159. The reversal of 1145413055150 is 515503145411.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a self number, because there is not a number n which added to its sum of digits gives 1145413055150.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1145413055159) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 125865017 + ... + 125874116.
It is an arithmetic number, because the mean of its divisors is an integer number (54627392078).
Almost surely, 21145413055150 is an apocalyptic number.
1145413055150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1145413055150 is an abundant number, since it is smaller than the sum of its proper divisors (1476701764594).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1145413055150 is a wasteful number, since it uses less digits than its factorization.
1145413055150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 251739165 (or 251739160 counting only the distinct ones).
The product of its (nonzero) digits is 30000, while the sum is 35.
The spelling of 1145413055150 in words is "one trillion, one hundred forty-five billion, four hundred thirteen million, fifty-five thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •