Base | Representation |
---|---|
bin | 110011010001110111110011… |
… | …0010110111111001101001001 |
3 | 2012011001122001022201102100112 |
4 | 1212203233212112333031021 |
5 | 433110104302010304421 |
6 | 4235152424050044105 |
7 | 164002536550604660 |
oct | 14643574626771511 |
9 | 2164048038642315 |
10 | 451057035244361 |
11 | 1207a223a3a9967 |
12 | 42709a60579635 |
13 | 1648b65a6a2260 |
14 | 7d553c40bbdd7 |
15 | 372306682645b |
hex | 19a3be65bf349 |
451057035244361 has 96 divisors (see below), whose sum is σ = 593918233649664. Its totient is φ = 332947625472000.
The previous prime is 451057035244337. The next prime is 451057035244367. The reversal of 451057035244361 is 163442530750154.
It is not a de Polignac number, because 451057035244361 - 222 = 451057031050057 is a prime.
It is not an unprimeable number, because it can be changed into a prime (451057035244367) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 14780501675 + ... + 14780532191.
It is an arithmetic number, because the mean of its divisors is an integer number (6186648267184).
Almost surely, 2451057035244361 is an apocalyptic number.
451057035244361 is a gapful number since it is divisible by the number (41) formed by its first and last digit.
It is an amenable number.
451057035244361 is a deficient number, since it is larger than the sum of its proper divisors (142861198405303).
451057035244361 is a wasteful number, since it uses less digits than its factorization.
451057035244361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34843 (or 34802 counting only the distinct ones).
The product of its (nonzero) digits is 6048000, while the sum is 50.
The spelling of 451057035244361 in words is "four hundred fifty-one trillion, fifty-seven billion, thirty-five million, two hundred forty-four thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •