Base | Representation |
---|---|
bin | 10100100111011011111000… |
… | …10111111010100101101111 |
3 | 12221112000202121100200010102 |
4 | 22103231330113322211233 |
5 | 21420234013403001414 |
6 | 240230454211101315 |
7 | 12356244056442065 |
oct | 1223557427724557 |
9 | 187460677320112 |
10 | 45335466453359 |
11 | 13499732a13205 |
12 | 5102397ba183b |
13 | 1c3b16821bcb4 |
14 | b2a369412035 |
15 | 53942d5baede |
hex | 293b7c5fa96f |
45335466453359 has 2 divisors, whose sum is σ = 45335466453360. Its totient is φ = 45335466453358.
The previous prime is 45335466453353. The next prime is 45335466453367. The reversal of 45335466453359 is 95335466453354.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 45335466453359 - 212 = 45335466449263 is a prime.
It is a super-2 number, since 2×453354664533592 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 45335466453295 and 45335466453304.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (45335466453353) 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 as a sum of consecutive naturals, namely, 22667733226679 + 22667733226680.
It is an arithmetic number, because the mean of its divisors is an integer number (22667733226680).
Almost surely, 245335466453359 is an apocalyptic number.
45335466453359 is a deficient number, since it is larger than the sum of its proper divisors (1).
45335466453359 is an equidigital number, since it uses as much as digits as its factorization.
45335466453359 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1049760000, while the sum is 65.
The spelling of 45335466453359 in words is "forty-five trillion, three hundred thirty-five billion, four hundred sixty-six million, four hundred fifty-three thousand, three hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •