Base | Representation |
---|---|
bin | 10010011100001010100010… |
… | …10011111000111011001011 |
3 | 12022120120000200222111211001 |
4 | 21032011101103320323023 |
5 | 20303333202001104211 |
6 | 222124252032515431 |
7 | 11353436346263641 |
oct | 1116052123707313 |
9 | 168516020874731 |
10 | 40550150409931 |
11 | 11a14249847848 |
12 | 466aa833abb77 |
13 | 1981b2a6988c6 |
14 | a028cddc3191 |
15 | 4a4c08505ac1 |
hex | 24e1514f8ecb |
40550150409931 has 2 divisors, whose sum is σ = 40550150409932. Its totient is φ = 40550150409930.
The previous prime is 40550150409911. The next prime is 40550150410037. The reversal of 40550150409931 is 13990405105504.
It is a happy number.
40550150409931 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 40550150409931 - 211 = 40550150407883 is a prime.
It is a super-2 number, since 2×405501504099312 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (40550150409911) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20275075204965 + 20275075204966.
It is an arithmetic number, because the mean of its divisors is an integer number (20275075204966).
Almost surely, 240550150409931 is an apocalyptic number.
40550150409931 is a deficient number, since it is larger than the sum of its proper divisors (1).
40550150409931 is an equidigital number, since it uses as much as digits as its factorization.
40550150409931 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486000, while the sum is 46.
The spelling of 40550150409931 in words is "forty trillion, five hundred fifty billion, one hundred fifty million, four hundred nine thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •