Base | Representation |
---|---|
bin | 1000011011110110100… |
… | …1011001100100110010 |
3 | 111212001102101122112012 |
4 | 2012331221121210302 |
5 | 4333241402323000 |
6 | 150323501402522 |
7 | 13320100563464 |
oct | 2067551314462 |
9 | 455042348465 |
10 | 144915667250 |
11 | 56505130762 |
12 | 24103b69442 |
13 | 10886104343 |
14 | 702a41a134 |
15 | 3b8256a735 |
hex | 21bda59932 |
144915667250 has 32 divisors (see below), whose sum is σ = 275880159360. Its totient is φ = 56983782000.
The previous prime is 144915667249. The next prime is 144915667283. The reversal of 144915667250 is 52766519441.
144915667250 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1449156672502 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (50).
It is a Curzon 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 15 ways as a sum of consecutive naturals, for example, 4897646 + ... + 4927145.
It is an arithmetic number, because the mean of its divisors is an integer number (8621254980).
Almost surely, 2144915667250 is an apocalyptic number.
144915667250 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
144915667250 is a deficient number, since it is larger than the sum of its proper divisors (130964492110).
144915667250 is an equidigital number, since it uses as much as digits as its factorization.
144915667250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9824867 (or 9824857 counting only the distinct ones).
The product of its (nonzero) digits is 1814400, while the sum is 50.
The spelling of 144915667250 in words is "one hundred forty-four billion, nine hundred fifteen million, six hundred sixty-seven thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •