Base | Representation |
---|---|
bin | 10010001111101100010111… |
… | …00010001010101011111111 |
3 | 12021001120221102011200120020 |
4 | 21013312023202022223333 |
5 | 20224323044402023011 |
6 | 221155342252023223 |
7 | 11310456256204140 |
oct | 1107661342125377 |
9 | 167046842150506 |
10 | 40121630501631 |
11 | 118695404a41a8 |
12 | 45bba10a61b13 |
13 | 19505b8506ca3 |
14 | 9c9c7c1b5ac7 |
15 | 4989c7de9006 |
hex | 247d8b88aaff |
40121630501631 has 8 divisors (see below), whose sum is σ = 61137722669184. Its totient is φ = 22926646000920.
The previous prime is 40121630501611. The next prime is 40121630501663. The reversal of 40121630501631 is 13610503612104.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 40121630501631 - 29 = 40121630501119 is a prime.
It is a super-2 number, since 2×401216305016312 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 40121630501592 and 40121630501601.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40121630501611) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 955276916685 + ... + 955276916726.
It is an arithmetic number, because the mean of its divisors is an integer number (7642215333648).
Almost surely, 240121630501631 is an apocalyptic number.
40121630501631 is a deficient number, since it is larger than the sum of its proper divisors (21016092167553).
40121630501631 is a wasteful number, since it uses less digits than its factorization.
40121630501631 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1910553833421.
The product of its (nonzero) digits is 12960, while the sum is 33.
The spelling of 40121630501631 in words is "forty trillion, one hundred twenty-one billion, six hundred thirty million, five hundred one thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •