Base | Representation |
---|---|
bin | 100111100010000000110… |
… | …0101011100001001001010 |
3 | 201020101221021111021100220 |
4 | 1033010001211130021022 |
5 | 1203004103004040013 |
6 | 15315543115210510 |
7 | 1100350526615100 |
oct | 117040145341112 |
9 | 21211837437326 |
10 | 5433160221258 |
11 | 18052103369a0 |
12 | 738b96446a36 |
13 | 3054637192b3 |
14 | 14ad75985c70 |
15 | 964e03d5b23 |
hex | 4f10195c24a |
5433160221258 has 768 divisors, whose sum is σ = 15680626237440. Its totient is φ = 1233908121600.
The previous prime is 5433160221211. The next prime is 5433160221271. The reversal of 5433160221258 is 8521220613345.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 383 ways as a sum of consecutive naturals, for example, 6553871988 + ... + 6553872816.
It is an arithmetic number, because the mean of its divisors is an integer number (20417482080).
Almost surely, 25433160221258 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5433160221258, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7840313118720).
5433160221258 is an abundant number, since it is smaller than the sum of its proper divisors (10247466016182).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5433160221258 is a wasteful number, since it uses less digits than its factorization.
5433160221258 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1043 (or 1036 counting only the distinct ones).
The product of its (nonzero) digits is 345600, while the sum is 42.
The spelling of 5433160221258 in words is "five trillion, four hundred thirty-three billion, one hundred sixty million, two hundred twenty-one thousand, two hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •