Base | Representation |
---|---|
bin | 101101001100010001111… |
… | …1011000101001110111100 |
3 | 210222210000000020010210022 |
4 | 1122120203323011032330 |
5 | 1303230341100304013 |
6 | 21113203541031312 |
7 | 1210511322544160 |
oct | 132304373051674 |
9 | 23883000203708 |
10 | 6211125400508 |
11 | 1a8513a401726 |
12 | 8439113b5538 |
13 | 3609255716a2 |
14 | 1768976a4ca0 |
15 | ab873ebc008 |
hex | 5a623ec53bc |
6211125400508 has 96 divisors (see below), whose sum is σ = 12892370287104. Its totient is φ = 2562975571968.
The previous prime is 6211125400499. The next prime is 6211125400523. The reversal of 6211125400508 is 8050045211126.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 167591516 + ... + 167628572.
It is an arithmetic number, because the mean of its divisors is an integer number (134295523824).
Almost surely, 26211125400508 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 6211125400508, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6446185143552).
6211125400508 is an abundant number, since it is smaller than the sum of its proper divisors (6681244886596).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6211125400508 is a wasteful number, since it uses less digits than its factorization.
6211125400508 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39091 (or 39089 counting only the distinct ones).
The product of its (nonzero) digits is 19200, while the sum is 35.
The spelling of 6211125400508 in words is "six trillion, two hundred eleven billion, one hundred twenty-five million, four hundred thousand, five hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •