Base | Representation |
---|---|
bin | 100110000100110011101… |
… | …1011101001111100001010 |
3 | 200112021022011000101022001 |
4 | 1030021213123221330022 |
5 | 1141214143400010300 |
6 | 15044002020221214 |
7 | 1050033516400453 |
oct | 114114733517412 |
9 | 20467264011261 |
10 | 5233005469450 |
11 | 173833a188440 |
12 | 706236b3a80a |
13 | 2bc616326405 |
14 | 1413c910012a |
15 | 911c859416a |
hex | 4c2676e9f0a |
5233005469450 has 24 divisors (see below), whose sum is σ = 10618243826400. Its totient is φ = 1902911079600.
The previous prime is 5233005469423. The next prime is 5233005469453. The reversal of 5233005469450 is 549645003325.
It is a super-2 number, since 2×52330054694502 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5233005469450.
It is not an unprimeable number, because it can be changed into a prime (5233005469453) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4757277150 + ... + 4757278249.
It is an arithmetic number, because the mean of its divisors is an integer number (442426826100).
Almost surely, 25233005469450 is an apocalyptic number.
5233005469450 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5233005469450 is an abundant number, since it is smaller than the sum of its proper divisors (5385238356950).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5233005469450 is a wasteful number, since it uses less digits than its factorization.
5233005469450 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9514555422 (or 9514555417 counting only the distinct ones).
The product of its (nonzero) digits is 1944000, while the sum is 46.
The spelling of 5233005469450 in words is "five trillion, two hundred thirty-three billion, five million, four hundred sixty-nine thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •