Base | Representation |
---|---|
bin | 1001001101101101000110… |
… | …1110010001010010001011 |
3 | 1022212112000101122202210111 |
4 | 2103123101232101102023 |
5 | 2311441343132422111 |
6 | 33314050224255151 |
7 | 2063641620324103 |
oct | 223332156212213 |
9 | 38775011582714 |
10 | 10131051451531 |
11 | 325661147925a |
12 | 11775707714b7 |
13 | 58647ab1320a |
14 | 2704ba0da203 |
15 | 1287ea24ca21 |
hex | 936d1b9148b |
10131051451531 has 16 divisors (see below), whose sum is σ = 10393418044800. Its totient is φ = 9869415105600.
The previous prime is 10131051451523. The next prime is 10131051451607. The reversal of 10131051451531 is 13515415013101.
It is not a de Polignac number, because 10131051451531 - 23 = 10131051451523 is a prime.
It is a super-2 number, since 2×101310514515312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10131051451493 and 10131051451502.
It is not an unprimeable number, because it can be changed into a prime (10131051451501) 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, 375057816 + ... + 375084826.
It is an arithmetic number, because the mean of its divisors is an integer number (649588627800).
Almost surely, 210131051451531 is an apocalyptic number.
10131051451531 is a deficient number, since it is larger than the sum of its proper divisors (262366593269).
10131051451531 is a wasteful number, since it uses less digits than its factorization.
10131051451531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40170.
The product of its (nonzero) digits is 4500, while the sum is 31.
Adding to 10131051451531 its reverse (13515415013101), we get a palindrome (23646466464632).
The spelling of 10131051451531 in words is "ten trillion, one hundred thirty-one billion, fifty-one million, four hundred fifty-one thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •