Base | Representation |
---|---|
bin | 10010111010000001… |
… | …00101111011000111 |
3 | 222012101201021101020 |
4 | 21131000211323013 |
5 | 131241443333030 |
6 | 4355113402223 |
7 | 506351505261 |
oct | 113500457307 |
9 | 28171637336 |
10 | 10150371015 |
11 | 433968aa84 |
12 | 1b73409373 |
13 | c59bb91c5 |
14 | 6c4106b31 |
15 | 3e61b2510 |
hex | 25d025ec7 |
10150371015 has 16 divisors (see below), whose sum is σ = 16241925600. Its totient is φ = 5413087232.
The previous prime is 10150370981. The next prime is 10150371019. The reversal of 10150371015 is 51017305101.
10150371015 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 10150371015 - 210 = 10150369991 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10150371019) 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, 252631 + ... + 290039.
It is an arithmetic number, because the mean of its divisors is an integer number (1015120350).
Almost surely, 210150371015 is an apocalyptic number.
10150371015 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10150371015 is a deficient number, since it is larger than the sum of its proper divisors (6091554585).
10150371015 is a wasteful number, since it uses less digits than its factorization.
10150371015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55506.
The product of its (nonzero) digits is 525, while the sum is 24.
Adding to 10150371015 its reverse (51017305101), we get a palindrome (61167676116).
The spelling of 10150371015 in words is "ten billion, one hundred fifty million, three hundred seventy-one thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •