Base | Representation |
---|---|
bin | 100101010111111101… |
… | …011111001110001011 |
3 | 10211120202111200110020 |
4 | 211113331133032023 |
5 | 1124141343121443 |
6 | 30234034351523 |
7 | 2620320062352 |
oct | 452775371613 |
9 | 124522450406 |
10 | 40130442123 |
11 | 16023652152 |
12 | 793b72b5a3 |
13 | 3a270c4355 |
14 | 1d29a44999 |
15 | 109d1a1583 |
hex | 957f5f38b |
40130442123 has 8 divisors (see below), whose sum is σ = 53622824448. Its totient is φ = 26695843944.
The previous prime is 40130442101. The next prime is 40130442133. The reversal of 40130442123 is 32124403104.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 40130442123 - 232 = 35835474827 is a prime.
It is a super-2 number, since 2×401304421232 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 40130442093 and 40130442102.
It is not an unprimeable number, because it can be changed into a prime (40130442133) 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 in 7 ways as a sum of consecutive naturals, for example, 14444415 + ... + 14447192.
It is an arithmetic number, because the mean of its divisors is an integer number (6702853056).
Almost surely, 240130442123 is an apocalyptic number.
40130442123 is a deficient number, since it is larger than the sum of its proper divisors (13492382325).
40130442123 is a wasteful number, since it uses less digits than its factorization.
40130442123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28892073.
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 40130442123 its reverse (32124403104), we get a palindrome (72254845227).
The spelling of 40130442123 in words is "forty billion, one hundred thirty million, four hundred forty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •