Base | Representation |
---|---|
bin | 100101011000000000… |
… | …011101111011001001 |
3 | 10211120210222100221112 |
4 | 211120000131323021 |
5 | 1124142043120431 |
6 | 30234103220105 |
7 | 2620326524564 |
oct | 453000357311 |
9 | 124523870845 |
10 | 40131223241 |
11 | 16024035aaa |
12 | 793ba47635 |
13 | 3a27308a55 |
14 | 1d29ba94db |
15 | 109d2a7c2b |
hex | 95801dec9 |
40131223241 has 4 divisors (see below), whose sum is σ = 40131773892. Its totient is φ = 40130672592.
The previous prime is 40131223163. The next prime is 40131223267. The reversal of 40131223241 is 14232213104.
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 15969629641 + 24161593600 = 126371^2 + 155440^2 .
It is a cyclic number.
It is not a de Polignac number, because 40131223241 - 218 = 40130961097 is a prime.
It is a super-2 number, since 2×401312232412 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (40137223241) 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, 145646 + ... + 318551.
It is an arithmetic number, because the mean of its divisors is an integer number (10032943473).
Almost surely, 240131223241 is an apocalyptic number.
It is an amenable number.
40131223241 is a deficient number, since it is larger than the sum of its proper divisors (550651).
40131223241 is an equidigital number, since it uses as much as digits as its factorization.
40131223241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 550650.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 40131223241 its reverse (14232213104), we get a palindrome (54363436345).
The spelling of 40131223241 in words is "forty billion, one hundred thirty-one million, two hundred twenty-three thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •