Base | Representation |
---|---|
bin | 10010001111111100001001… |
… | …00010010001000111001111 |
3 | 12021002101210212201022121002 |
4 | 21013332010202101013033 |
5 | 20224442422333201111 |
6 | 221203303111330515 |
7 | 11311206235350611 |
oct | 1107760442210717 |
9 | 167071725638532 |
10 | 40130103022031 |
11 | 11872098a6a180 |
12 | 4601596380a3b |
13 | 1951338900479 |
14 | 9ca443520db1 |
15 | 498d21b3063b |
hex | 247f848911cf |
40130103022031 has 16 divisors (see below), whose sum is σ = 43858482877440. Its totient is φ = 36415135602720.
The previous prime is 40130103022003. The next prime is 40130103022073. The reversal of 40130103022031 is 13022030103104.
It is a cyclic number.
It is not a de Polignac number, because 40130103022031 - 222 = 40130098827727 is a prime.
It is a super-2 number, since 2×401301030220312 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 40130103021994 and 40130103022012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40130103022631) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15670865 + ... + 18050933.
It is an arithmetic number, because the mean of its divisors is an integer number (2741155179840).
Almost surely, 240130103022031 is an apocalyptic number.
40130103022031 is a deficient number, since it is larger than the sum of its proper divisors (3728379855409).
40130103022031 is a wasteful number, since it uses less digits than its factorization.
40130103022031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2382886.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 40130103022031 its reverse (13022030103104), we get a palindrome (53152133125135).
The spelling of 40130103022031 in words is "forty trillion, one hundred thirty billion, one hundred three million, twenty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •