Base | Representation |
---|---|
bin | 100100001100000011010… |
… | …0111010101111100010000 |
3 | 122121110221112020101000211 |
4 | 1020120012213111330100 |
5 | 1122442100333334202 |
6 | 14324513430053504 |
7 | 1022223334564300 |
oct | 110300647257420 |
9 | 18543845211024 |
10 | 4973683105552 |
11 | 16483664a4217 |
12 | 683b244aa294 |
13 | 2a1029a89085 |
14 | 132a28561600 |
15 | 8959c1231d7 |
hex | 486069d5f10 |
4973683105552 has 90 divisors (see below), whose sum is σ = 11248360496538. Its totient is φ = 2124274715136.
The previous prime is 4973683105543. The next prime is 4973683105577. The reversal of 4973683105552 is 2555013863794.
It can be written as a sum of positive squares in 3 ways, for example, as 3756138581776 + 1217544523776 = 1938076^2 + 1103424^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 67268668 + ... + 67342564.
It is a 1-persistent number, because it is pandigital, but 2⋅4973683105552 = 9947366211104 is not.
Almost surely, 24973683105552 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 4973683105552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5624180248269).
4973683105552 is an abundant number, since it is smaller than the sum of its proper divisors (6274677390986).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4973683105552 is an equidigital number, since it uses as much as digits as its factorization.
4973683105552 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 74505 (or 74199 counting only the distinct ones).
The product of its (nonzero) digits is 27216000, while the sum is 58.
The spelling of 4973683105552 in words is "four trillion, nine hundred seventy-three billion, six hundred eighty-three million, one hundred five thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •