Base | Representation |
---|---|
bin | 110011101111101001110110… |
… | …0111110100110110001000001 |
3 | 2012200112221100111122202111012 |
4 | 1213133103230332212301001 |
5 | 434124140203013021101 |
6 | 4252005045514330305 |
7 | 164604343333206434 |
oct | 14737235476466101 |
9 | 2180487314582435 |
10 | 455150250126401 |
11 | 1220301564aa025 |
12 | 4306b201a29995 |
13 | 166c763b36c50b |
14 | 805756529981b |
15 | 3794780eeabbb |
hex | 19df4ecfa6c41 |
455150250126401 has 8 divisors (see below), whose sum is σ = 456873506192040. Its totient is φ = 453428149450752.
The previous prime is 455150250126053. The next prime is 455150250126421. The reversal of 455150250126401 is 104621052051554.
It can be written as a sum of positive squares in 4 ways, for example, as 48067168436401 + 407083081690000 = 6933049^2 + 20176300^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 455150250126401 - 230 = 455149176384577 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (455150250126421) 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, 288058130 + ... + 289633883.
It is an arithmetic number, because the mean of its divisors is an integer number (57109188274005).
Almost surely, 2455150250126401 is an apocalyptic number.
It is an amenable number.
455150250126401 is a deficient number, since it is larger than the sum of its proper divisors (1723256065639).
455150250126401 is a wasteful number, since it uses less digits than its factorization.
455150250126401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 577694995.
The product of its (nonzero) digits is 240000, while the sum is 41.
The spelling of 455150250126401 in words is "four hundred fifty-five trillion, one hundred fifty billion, two hundred fifty million, one hundred twenty-six thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.276 sec. • engine limits •