Base | Representation |
---|---|
bin | 100010010011110111110000… |
… | …100000110000111110001001 |
3 | 201210021211000012111201121001 |
4 | 202103313300200300332021 |
5 | 124234312400002201101 |
6 | 1252534033234215001 |
7 | 43533046615235656 |
oct | 4223676040607611 |
9 | 653254005451531 |
10 | 150899121131401 |
11 | 44098a59a46075 |
12 | 14b11316424461 |
13 | 6627959219a16 |
14 | 29397b0bc6c2d |
15 | 126a374705901 |
hex | 893df0830f89 |
150899121131401 has 8 divisors (see below), whose sum is σ = 155016327117960. Its totient is φ = 146783959953408.
The previous prime is 150899121131393. The next prime is 150899121131417. The reversal of 150899121131401 is 104131121998051.
It can be written as a sum of positive squares in 4 ways, for example, as 64182145413376 + 86716975718025 = 8011376^2 + 9312195^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 150899121131401 - 23 = 150899121131393 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (150899121138401) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 511052536 + ... + 511347721.
It is an arithmetic number, because the mean of its divisors is an integer number (19377040889745).
Almost surely, 2150899121131401 is an apocalyptic number.
It is an amenable number.
150899121131401 is a deficient number, since it is larger than the sum of its proper divisors (4117205986559).
150899121131401 is a wasteful number, since it uses less digits than its factorization.
150899121131401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1022404283.
The product of its (nonzero) digits is 77760, while the sum is 46.
The spelling of 150899121131401 in words is "one hundred fifty trillion, eight hundred ninety-nine billion, one hundred twenty-one million, one hundred thirty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •