Base | Representation |
---|---|
bin | 10010101000000111… |
… | …00100001110010101 |
3 | 221210221001112111011 |
4 | 21110003210032111 |
5 | 130440014434131 |
6 | 4332150012221 |
7 | 502545630265 |
oct | 112403441625 |
9 | 27727045434 |
10 | 10000155541 |
11 | 4271910962 |
12 | 1b31047071 |
13 | c34a431cc |
14 | 6ac1a37a5 |
15 | 3d7dde0b1 |
hex | 2540e4395 |
10000155541 has 8 divisors (see below), whose sum is σ = 10113019704. Its totient is φ = 9887563200.
The previous prime is 10000155511. The next prime is 10000155559. The reversal of 10000155541 is 14555100001.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 5651280625 + 4348874916 = 75175^2 + 65946^2 .
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 10000155541 - 215 = 10000122773 is a prime.
It is a super-2 number, since 2×100001555412 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10000155511) 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, 6495 + ... + 141571.
It is an arithmetic number, because the mean of its divisors is an integer number (1264127463).
Almost surely, 210000155541 is an apocalyptic number.
It is an amenable number.
10000155541 is a deficient number, since it is larger than the sum of its proper divisors (112864163).
10000155541 is a wasteful number, since it uses less digits than its factorization.
10000155541 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 135911.
The product of its (nonzero) digits is 500, while the sum is 22.
Adding to 10000155541 its reverse (14555100001), we get a palindrome (24555255542).
The spelling of 10000155541 in words is "ten billion, one hundred fifty-five thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •