Base | Representation |
---|---|
bin | 111100100110001111011011… |
… | …1100001000000110100100000 |
3 | 2120220021100102012020112020102 |
4 | 1321030132313201000310200 |
5 | 1024331010314214021003 |
6 | 5125350353024401532 |
7 | 220162345213231616 |
oct | 17114366741006440 |
9 | 2526240365215212 |
10 | 533021405220128 |
11 | 144923121453270 |
12 | 4b9471521762a8 |
13 | 19b5591a196256 |
14 | 958a5334956b6 |
15 | 419519b20d588 |
hex | 1e4c7b7840d20 |
533021405220128 has 48 divisors (see below), whose sum is σ = 1152365964079680. Its totient is φ = 240677937312000.
The previous prime is 533021405220127. The next prime is 533021405220163. The reversal of 533021405220128 is 821022504120335.
It is a super-2 number, since 2×5330214052201282 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 533021405220091 and 533021405220100.
It is not an unprimeable number, because it can be changed into a prime (533021405220127) 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, 5014070543 + ... + 5014176846.
It is an arithmetic number, because the mean of its divisors is an integer number (24007624251660).
Almost surely, 2533021405220128 is an apocalyptic number.
It is an amenable number.
533021405220128 is an abundant number, since it is smaller than the sum of its proper divisors (619344558859552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
533021405220128 is a wasteful number, since it uses less digits than its factorization.
533021405220128 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10028247561 (or 10028247553 counting only the distinct ones).
The product of its (nonzero) digits is 115200, while the sum is 38.
The spelling of 533021405220128 in words is "five hundred thirty-three trillion, twenty-one billion, four hundred five million, two hundred twenty thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •