Base | Representation |
---|---|
bin | 100111011100100110100… |
… | …0010000001111000111011 |
3 | 201012021221112002000120112 |
4 | 1032321031002001320323 |
5 | 1202311304010331321 |
6 | 15310342133214535 |
7 | 1066456562015150 |
oct | 116711502017073 |
9 | 21167845060515 |
10 | 5421541105211 |
11 | 1800298684050 |
12 | 73689319144b |
13 | 3043314620ba |
14 | 14a592794227 |
15 | 960602eea5b |
hex | 4ee4d081e3b |
5421541105211 has 32 divisors (see below), whose sum is σ = 6767850385920. Its totient is φ = 4219251379200.
The previous prime is 5421541105117. The next prime is 5421541105217. The reversal of 5421541105211 is 1125011451245.
5421541105211 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 5421541105211 - 238 = 5146663198267 is a prime.
It is a super-2 number, since 2×54215411052112 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5421541105217) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 272552576 + ... + 272572466.
It is an arithmetic number, because the mean of its divisors is an integer number (211495324560).
Almost surely, 25421541105211 is an apocalyptic number.
5421541105211 is a deficient number, since it is larger than the sum of its proper divisors (1346309280709).
5421541105211 is a wasteful number, since it uses less digits than its factorization.
5421541105211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24195.
The product of its (nonzero) digits is 8000, while the sum is 32.
Adding to 5421541105211 its reverse (1125011451245), we get a palindrome (6546552556456).
The spelling of 5421541105211 in words is "five trillion, four hundred twenty-one billion, five hundred forty-one million, one hundred five thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •