Base | Representation |
---|---|
bin | 10010110100001001… |
… | …10101010111101111 |
3 | 222001222002122111200 |
4 | 21122010311113233 |
5 | 131141343314330 |
6 | 4350154420543 |
7 | 505213240311 |
oct | 113204652757 |
9 | 28058078450 |
10 | 10101151215 |
11 | 4313922461 |
12 | 1b5aa31753 |
13 | c4c944c6c |
14 | 6bb7737b1 |
15 | 3e1bdda60 |
hex | 25a1355ef |
10101151215 has 12 divisors (see below), whose sum is σ = 17508662184. Its totient is φ = 5387280624.
The previous prime is 10101151183. The next prime is 10101151243. The reversal of 10101151215 is 51215110101.
It is not a de Polignac number, because 10101151215 - 25 = 10101151183 is a prime.
It is a super-3 number, since 3×101011512153 (a number of 31 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 112234969 + ... + 112235058.
It is an arithmetic number, because the mean of its divisors is an integer number (1459055182).
Almost surely, 210101151215 is an apocalyptic number.
10101151215 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10101151215 is a deficient number, since it is larger than the sum of its proper divisors (7407510969).
10101151215 is a wasteful number, since it uses less digits than its factorization.
10101151215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 224470038 (or 224470035 counting only the distinct ones).
The product of its (nonzero) digits is 50, while the sum is 18.
Adding to 10101151215 its reverse (51215110101), we get a palindrome (61316261316).
The spelling of 10101151215 in words is "ten billion, one hundred one million, one hundred fifty-one thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •