Base | Representation |
---|---|
bin | 100010001100110100111001… |
… | …100011011001100101001110 |
3 | 201201120112110000220010010212 |
4 | 202030310321203121211032 |
5 | 124203344422401114400 |
6 | 1251523412025202422 |
7 | 43453061204206220 |
oct | 4214647143314516 |
9 | 651515400803125 |
10 | 150415015254350 |
11 | 43a21716888480 |
12 | 14a53530330412 |
13 | 65c10c8c34632 |
14 | 29201a8854410 |
15 | 125c98e152335 |
hex | 88cd398d994e |
150415015254350 has 384 divisors, whose sum is σ = 362847326284800. Its totient is φ = 45028948377600.
The previous prime is 150415015254337. The next prime is 150415015254373. The reversal of 150415015254350 is 53452510514051.
It is a junction number, because it is equal to n+sod(n) for n = 150415015254298 and 150415015254307.
It is a congruent number.
It is an unprimeable number.
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 191 ways as a sum of consecutive naturals, for example, 16659095636 + ... + 16659104664.
It is an arithmetic number, because the mean of its divisors is an integer number (944914912200).
Almost surely, 2150415015254350 is an apocalyptic number.
150415015254350 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
150415015254350 is an abundant number, since it is smaller than the sum of its proper divisors (212432311030450).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150415015254350 is a wasteful number, since it uses less digits than its factorization.
150415015254350 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10588 (or 10583 counting only the distinct ones).
The product of its (nonzero) digits is 300000, while the sum is 41.
The spelling of 150415015254350 in words is "one hundred fifty trillion, four hundred fifteen billion, fifteen million, two hundred fifty-four thousand, three hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •