Base | Representation |
---|---|
bin | 100000010011000… |
… | …010111111011011 |
3 | 1101202121112112022 |
4 | 200103002333123 |
5 | 2102204121044 |
6 | 125434005055 |
7 | 16266524063 |
oct | 4023027733 |
9 | 1352545468 |
10 | 541863899 |
11 | 258960405 |
12 | 13157678b |
13 | 88352135 |
14 | 51d723a3 |
15 | 328873ee |
hex | 204c2fdb |
541863899 has 8 divisors (see below), whose sum is σ = 574132608. Its totient is φ = 509639040.
The previous prime is 541863857. The next prime is 541863929. The reversal of 541863899 is 998368145.
541863899 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 541863899 - 28 = 541863643 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 541863899.
It is not an unprimeable number, because it can be changed into a prime (541863499) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16469 + ... + 36809.
It is an arithmetic number, because the mean of its divisors is an integer number (71766576).
Almost surely, 2541863899 is an apocalyptic number.
541863899 is a deficient number, since it is larger than the sum of its proper divisors (32268709).
541863899 is a wasteful number, since it uses less digits than its factorization.
541863899 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21925.
The product of its digits is 1866240, while the sum is 53.
The square root of 541863899 is about 23277.9702508617. The cubic root of 541863899 is about 815.2611350340.
It can be divided in two parts, 54186 and 3899, that added together give a palindrome (58085).
The spelling of 541863899 in words is "five hundred forty-one million, eight hundred sixty-three thousand, eight hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •