Base | Representation |
---|---|
bin | 1000110111101110011… |
… | …0000001101101011001 |
3 | 112120100211122010202210 |
4 | 2031323212001231121 |
5 | 4444102214441101 |
6 | 154002125345333 |
7 | 14003356465011 |
oct | 2157346015531 |
9 | 476324563683 |
10 | 152397421401 |
11 | 596a440a355 |
12 | 25651708249 |
13 | 114a91744c4 |
14 | 7539d3cc41 |
15 | 3e6e2e67d6 |
hex | 237b981b59 |
152397421401 has 4 divisors (see below), whose sum is σ = 203196561872. Its totient is φ = 101598280932.
The previous prime is 152397421391. The next prime is 152397421409. The reversal of 152397421401 is 104124793251.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 152397421401 - 27 = 152397421273 is a prime.
It is a super-4 number, since 4×1523974214014 (a number of 46 digits) contains 4444 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 152397421401.
It is not an unprimeable number, because it can be changed into a prime (152397421409) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 25399570231 + ... + 25399570236.
It is an arithmetic number, because the mean of its divisors is an integer number (50799140468).
Almost surely, 2152397421401 is an apocalyptic number.
It is an amenable number.
152397421401 is a deficient number, since it is larger than the sum of its proper divisors (50799140471).
152397421401 is an equidigital number, since it uses as much as digits as its factorization.
152397421401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50799140470.
The product of its (nonzero) digits is 60480, while the sum is 39.
The spelling of 152397421401 in words is "one hundred fifty-two billion, three hundred ninety-seven million, four hundred twenty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •