Base | Representation |
---|---|
bin | 100000010001110… |
… | …110100110110111 |
3 | 1101202000122100121 |
4 | 200101312212313 |
5 | 2102114113111 |
6 | 125423152411 |
7 | 16264051660 |
oct | 4021664667 |
9 | 1352018317 |
10 | 541551031 |
11 | 25876733a |
12 | 131445707 |
13 | 882728c8 |
14 | 51cd0367 |
15 | 32824871 |
hex | 204769b7 |
541551031 has 48 divisors (see below), whose sum is σ = 698840064. Its totient is φ = 410167296.
The previous prime is 541551019. The next prime is 541551041. The reversal of 541551031 is 130155145.
It is a happy number.
541551031 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 541551031 - 29 = 541550519 is a prime.
It is a super-2 number, since 2×5415510312 = 586555038354325922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 541550987 and 541551005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (541551041) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 4792431 + ... + 4792543.
It is an arithmetic number, because the mean of its divisors is an integer number (14559168).
Almost surely, 2541551031 is an apocalyptic number.
541551031 is a deficient number, since it is larger than the sum of its proper divisors (157289033).
541551031 is a wasteful number, since it uses less digits than its factorization.
541551031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 280 (or 263 counting only the distinct ones).
The product of its (nonzero) digits is 1500, while the sum is 25.
The square root of 541551031 is about 23271.2490210560. The cubic root of 541551031 is about 815.1041963460.
The spelling of 541551031 in words is "five hundred forty-one million, five hundred fifty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •