Base | Representation |
---|---|
bin | 100111010111111100000… |
… | …0101100001001001000100 |
3 | 201011100002112221001202121 |
4 | 1032233320011201021010 |
5 | 1202130301130143300 |
6 | 15302004251215324 |
7 | 1065653442142021 |
oct | 116577005411104 |
9 | 21140075831677 |
10 | 5411526021700 |
11 | 17a70193a7627 |
12 | 734959147544 |
13 | 3033c65c3296 |
14 | 149cc2626548 |
15 | 95b75e6281a |
hex | 4ebf8161244 |
5411526021700 has 72 divisors (see below), whose sum is σ = 12619355872032. Its totient is φ = 2006873172480.
The previous prime is 5411526021697. The next prime is 5411526021721. The reversal of 5411526021700 is 71206251145.
It is a super-2 number, since 2×54115260217002 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (34).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 23641702 + ... + 23869501.
It is an arithmetic number, because the mean of its divisors is an integer number (175268831556).
Almost surely, 25411526021700 is an apocalyptic number.
5411526021700 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5411526021700 is an abundant number, since it is smaller than the sum of its proper divisors (7207829850332).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5411526021700 is a wasteful number, since it uses less digits than its factorization.
5411526021700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47511301 (or 47511294 counting only the distinct ones).
The product of its (nonzero) digits is 16800, while the sum is 34.
The spelling of 5411526021700 in words is "five trillion, four hundred eleven billion, five hundred twenty-six million, twenty-one thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •