Base | Representation |
---|---|
bin | 1001001110001110100111… |
… | …0000010000111011010011 |
3 | 1022220101020010210010022212 |
4 | 2103203221300100323103 |
5 | 2312113302401442011 |
6 | 33322134442022335 |
7 | 2064410520442331 |
oct | 223435160207323 |
9 | 38811203703285 |
10 | 10140044562131 |
11 | 325a406894370 |
12 | 11792604a79ab |
13 | 587282020733 |
14 | 270ad063ab51 |
15 | 128b74a1808b |
hex | 938e9c10ed3 |
10140044562131 has 32 divisors (see below), whose sum is σ = 11719823385600. Its totient is φ = 8685654324480.
The previous prime is 10140044562041. The next prime is 10140044562139. The reversal of 10140044562131 is 13126544004101.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10140044562131 is a prime.
It is a super-2 number, since 2×101400445621312 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10140044562139) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 15159110 + ... + 15813876.
It is an arithmetic number, because the mean of its divisors is an integer number (366244480800).
Almost surely, 210140044562131 is an apocalyptic number.
10140044562131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10140044562131 is a deficient number, since it is larger than the sum of its proper divisors (1579778823469).
10140044562131 is a wasteful number, since it uses less digits than its factorization.
10140044562131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 655979.
The product of its (nonzero) digits is 11520, while the sum is 32.
Adding to 10140044562131 its reverse (13126544004101), we get a palindrome (23266588566232).
The spelling of 10140044562131 in words is "ten trillion, one hundred forty billion, forty-four million, five hundred sixty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •