Base | Representation |
---|---|
bin | 10010110001010010… |
… | …100110101000011001 |
3 | 1221000120220012012222 |
4 | 102301102212220121 |
5 | 312234001010431 |
6 | 13131520513425 |
7 | 1312304556506 |
oct | 226122465031 |
9 | 57016805188 |
10 | 20154313241 |
11 | 8602647927 |
12 | 3aa577b875 |
13 | 1b92656b4a |
14 | d929b44ad |
15 | 7ce59d57b |
hex | 4b14a6a19 |
20154313241 has 4 divisors (see below), whose sum is σ = 20160008484. Its totient is φ = 20148618000.
The previous prime is 20154313219. The next prime is 20154313261. The reversal of 20154313241 is 14231345102.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 15030760000 + 5123553241 = 122600^2 + 71579^2 .
It is a cyclic number.
It is not a de Polignac number, because 20154313241 - 214 = 20154296857 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 20154313241.
It is not an unprimeable number, because it can be changed into a prime (20154313261) 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, 2842310 + ... + 2849391.
It is an arithmetic number, because the mean of its divisors is an integer number (5040002121).
Almost surely, 220154313241 is an apocalyptic number.
It is an amenable number.
20154313241 is a deficient number, since it is larger than the sum of its proper divisors (5695243).
20154313241 is an equidigital number, since it uses as much as digits as its factorization.
20154313241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5695242.
The product of its (nonzero) digits is 2880, while the sum is 26.
Adding to 20154313241 its reverse (14231345102), we get a palindrome (34385658343).
The spelling of 20154313241 in words is "twenty billion, one hundred fifty-four million, three hundred thirteen thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •