Base | Representation |
---|---|
bin | 11100001000000110… |
… | …11110010110000001 |
3 | 1102222101002001121202 |
4 | 32010003132112001 |
5 | 221411200430441 |
6 | 10534222030545 |
7 | 1043126216504 |
oct | 160403362601 |
9 | 42871061552 |
10 | 15100405121 |
11 | 644986a95a |
12 | 2b15118455 |
13 | 15685a2079 |
14 | a336bd13b |
15 | 5d5a4919b |
hex | 3840de581 |
15100405121 has 4 divisors (see below), whose sum is σ = 15103326000. Its totient is φ = 15097484244.
The previous prime is 15100405051. The next prime is 15100405123. The reversal of 15100405121 is 12150400151.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 12150400151 = 2797 ⋅4344083.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-15100405121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 15100405093 and 15100405102.
It is not an unprimeable number, because it can be changed into a prime (15100405123) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1452671 + ... + 1463028.
It is an arithmetic number, because the mean of its divisors is an integer number (3775831500).
Almost surely, 215100405121 is an apocalyptic number.
It is an amenable number.
15100405121 is a deficient number, since it is larger than the sum of its proper divisors (2920879).
15100405121 is an equidigital number, since it uses as much as digits as its factorization.
15100405121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2920878.
The product of its (nonzero) digits is 200, while the sum is 20.
Adding to 15100405121 its reverse (12150400151), we get a palindrome (27250805272).
The spelling of 15100405121 in words is "fifteen billion, one hundred million, four hundred five thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •