Base | Representation |
---|---|
bin | 100100100111110101101… |
… | …0011011001011111110111 |
3 | 122211011222010100221221000 |
4 | 1021033223103121133313 |
5 | 1124431302213401201 |
6 | 14412142513454343 |
7 | 1026435133530432 |
oct | 111175323313767 |
9 | 18734863327830 |
10 | 5033354434551 |
11 | 16706a73a4953 |
12 | 6935b82713b3 |
13 | 2a68493ba381 |
14 | 1358894da819 |
15 | 8ade0aa1d86 |
hex | 493eb4d97f7 |
5033354434551 has 32 divisors (see below), whose sum is σ = 7829086867200. Its totient is φ = 3191504168160.
The previous prime is 5033354434501. The next prime is 5033354434597. The reversal of 5033354434551 is 1554344533305.
5033354434551 is a `hidden beast` number, since 5 + 0 + 3 + 3 + 3 + 54 + 43 + 4 + 551 = 666.
It is not a de Polignac number, because 5033354434551 - 26 = 5033354434487 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5033354434497 and 5033354434506.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5033354434501) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 47919885 + ... + 48024806.
It is an arithmetic number, because the mean of its divisors is an integer number (244658964600).
Almost surely, 25033354434551 is an apocalyptic number.
5033354434551 is a deficient number, since it is larger than the sum of its proper divisors (2795732432649).
5033354434551 is a wasteful number, since it uses less digits than its factorization.
5033354434551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95944796 (or 95944790 counting only the distinct ones).
The product of its (nonzero) digits is 3240000, while the sum is 45.
Adding to 5033354434551 its reverse (1554344533305), we get a palindrome (6587698967856).
The spelling of 5033354434551 in words is "five trillion, thirty-three billion, three hundred fifty-four million, four hundred thirty-four thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •