Base | Representation |
---|---|
bin | 111101111111111010010010… |
… | …0111111100010100100001001 |
3 | 2122111220112001202200101002202 |
4 | 1323333310210333202210021 |
5 | 1032434420042244031213 |
6 | 5211504133205205545 |
7 | 222603624644000543 |
oct | 17377644477424411 |
9 | 2574815052611082 |
10 | 545345503111433 |
11 | 148844802418812 |
12 | 511b77417008b5 |
13 | 1a53ab250667cb |
14 | 9894c12814693 |
15 | 430aa4c1b8b58 |
hex | 1effd24fe2909 |
545345503111433 has 64 divisors (see below), whose sum is σ = 599159381280768. Its totient is φ = 494333326556160.
The previous prime is 545345503111397. The next prime is 545345503111471. The reversal of 545345503111433 is 334111305543545.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-545345503111433 is a prime.
It is not an unprimeable number, because it can be changed into a prime (545345503111033) 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 63 ways as a sum of consecutive naturals, for example, 56883848666 + ... + 56883858252.
It is an arithmetic number, because the mean of its divisors is an integer number (9361865332512).
Almost surely, 2545345503111433 is an apocalyptic number.
It is an amenable number.
545345503111433 is a deficient number, since it is larger than the sum of its proper divisors (53813878169335).
545345503111433 is a wasteful number, since it uses less digits than its factorization.
545345503111433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13502.
The product of its (nonzero) digits is 3240000, while the sum is 47.
Adding to 545345503111433 its reverse (334111305543545), we get a palindrome (879456808654978).
The spelling of 545345503111433 in words is "five hundred forty-five trillion, three hundred forty-five billion, five hundred three million, one hundred eleven thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •