Base | Representation |
---|---|
bin | 10011000001101110… |
… | …01100001011011011 |
3 | 222100220100112102202 |
4 | 21200313030023123 |
5 | 131410020441011 |
6 | 4405343120415 |
7 | 511065124136 |
oct | 114067141333 |
9 | 28326315382 |
10 | 10215015131 |
11 | 4372123072 |
12 | 1b90ba310b |
13 | c6a400c69 |
14 | 6cc93321d |
15 | 3ebbd123b |
hex | 260dcc2db |
10215015131 has 16 divisors (see below), whose sum is σ = 10981526400. Its totient is φ = 9467547648.
The previous prime is 10215015121. The next prime is 10215015191. The reversal of 10215015131 is 13151051201.
It is a happy number.
10215015131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10215015131 is a prime.
It is a super-2 number, since 2×102150151312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10215015121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 512651 + ... + 532203.
It is an arithmetic number, because the mean of its divisors is an integer number (686345400).
Almost surely, 210215015131 is an apocalyptic number.
10215015131 is a deficient number, since it is larger than the sum of its proper divisors (766511269).
10215015131 is a wasteful number, since it uses less digits than its factorization.
10215015131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20038.
The product of its (nonzero) digits is 150, while the sum is 20.
Adding to 10215015131 its reverse (13151051201), we get a palindrome (23366066332).
The spelling of 10215015131 in words is "ten billion, two hundred fifteen million, fifteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •