Base | Representation |
---|---|
bin | 100111100111001010011… |
… | …1100010101110100010000 |
3 | 201021110111012221200112001 |
4 | 1033032110330111310100 |
5 | 1203144231414110000 |
6 | 15325012524243344 |
7 | 1101221622642163 |
oct | 117162474256420 |
9 | 21243435850461 |
10 | 5444222410000 |
11 | 1809977690040 |
12 | 73b1630a0554 |
13 | 3065074a8bca |
14 | 14b704c03ada |
15 | 9693b65b46a |
hex | 4f394f15d10 |
5444222410000 has 200 divisors, whose sum is σ = 14389164418464. Its totient is φ = 1978356480000.
The previous prime is 5444222409949. The next prime is 5444222410087. The reversal of 5444222410000 is 142224445.
It is a tau number, because it is divible by the number of its divisors (200).
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 167513752 + ... + 167546248.
Almost surely, 25444222410000 is an apocalyptic number.
5444222410000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5444222410000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7194582209232).
5444222410000 is an abundant number, since it is smaller than the sum of its proper divisors (8944942008464).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5444222410000 is a wasteful number, since it uses less digits than its factorization.
5444222410000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34059 (or 34038 counting only the distinct ones).
The product of its (nonzero) digits is 10240, while the sum is 28.
Adding to 5444222410000 its reverse (142224445), we get a palindrome (5444364634445).
The spelling of 5444222410000 in words is "five trillion, four hundred forty-four billion, two hundred twenty-two million, four hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •