Base | Representation |
---|---|
bin | 10010111010111011… |
… | …11010011011111101 |
3 | 222012221011202212020 |
4 | 21131131322123331 |
5 | 131300430312323 |
6 | 4355550230353 |
7 | 506504030103 |
oct | 113535723375 |
9 | 28187152766 |
10 | 10158057213 |
11 | 4342a5a807 |
12 | 1b75ab53b9 |
13 | c5b67a855 |
14 | 6c5147c73 |
15 | 3e6bceae3 |
hex | 25d77a6fd |
10158057213 has 16 divisors (see below), whose sum is σ = 13885843776. Its totient is φ = 6601426560.
The previous prime is 10158057197. The next prime is 10158057251. The reversal of 10158057213 is 31275085101.
It is not a de Polignac number, because 10158057213 - 24 = 10158057197 is a prime.
It is a super-2 number, since 2×101580572132 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10158057713) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 118770 + ... + 185532.
It is an arithmetic number, because the mean of its divisors is an integer number (867865236).
Almost surely, 210158057213 is an apocalyptic number.
It is an amenable number.
10158057213 is a deficient number, since it is larger than the sum of its proper divisors (3727786563).
10158057213 is a wasteful number, since it uses less digits than its factorization.
10158057213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68044.
The product of its (nonzero) digits is 8400, while the sum is 33.
The spelling of 10158057213 in words is "ten billion, one hundred fifty-eight million, fifty-seven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •