Base | Representation |
---|---|
bin | 10100111101000001111… |
… | …011000100101100110110 |
3 | 12002122200111121101202100 |
4 | 110331001323010230312 |
5 | 142042424013031300 |
6 | 3021253511522530 |
7 | 206013363320265 |
oct | 24750173045466 |
9 | 5078614541670 |
10 | 1439920048950 |
11 | 505737368989 |
12 | 1b3096389446 |
13 | a5a26245406 |
14 | 4d99a3245dc |
15 | 276c7b02700 |
hex | 14f41ec4b36 |
1439920048950 has 72 divisors (see below), whose sum is σ = 4096149055128. Its totient is φ = 361391696640.
The previous prime is 1439920048943. The next prime is 1439920048951. The reversal of 1439920048950 is 598400299341.
1439920048950 is a `hidden beast` number, since 1 + 4 + 3 + 99 + 20 + 0 + 489 + 50 = 666.
It is a super-2 number, since 2×14399200489502 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1439920048951) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 94104772 + ... + 94120071.
It is an arithmetic number, because the mean of its divisors is an integer number (56890959099).
Almost surely, 21439920048950 is an apocalyptic number.
1439920048950 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1439920048950 is an abundant number, since it is smaller than the sum of its proper divisors (2656229006178).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1439920048950 is a wasteful number, since it uses less digits than its factorization.
1439920048950 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 188224878 (or 188224870 counting only the distinct ones).
The product of its (nonzero) digits is 2799360, while the sum is 54.
The spelling of 1439920048950 in words is "one trillion, four hundred thirty-nine billion, nine hundred twenty million, forty-eight thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •