Base | Representation |
---|---|
bin | 110000111101101101… |
… | …1011011000101010101 |
3 | 101001102002021112011202 |
4 | 1201323123123011111 |
5 | 3210321400021433 |
6 | 120145533242245 |
7 | 10411500160055 |
oct | 1417333330525 |
9 | 331362245152 |
10 | 105150001493 |
11 | 40659486489 |
12 | 18466633385 |
13 | 9bb976aac4 |
14 | 513700b565 |
15 | 2b06420ee8 |
hex | 187b6db155 |
105150001493 has 2 divisors, whose sum is σ = 105150001494. Its totient is φ = 105150001492.
The previous prime is 105150001459. The next prime is 105150001511. The reversal of 105150001493 is 394100051501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 96362438929 + 8787562564 = 310423^2 + 93742^2 .
It is a cyclic number.
It is not a de Polignac number, because 105150001493 - 28 = 105150001237 is a prime.
It is a super-2 number, since 2×1051500014932 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105150000493) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52575000746 + 52575000747.
It is an arithmetic number, because the mean of its divisors is an integer number (52575000747).
Almost surely, 2105150001493 is an apocalyptic number.
It is an amenable number.
105150001493 is a deficient number, since it is larger than the sum of its proper divisors (1).
105150001493 is an equidigital number, since it uses as much as digits as its factorization.
105150001493 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2700, while the sum is 29.
Adding to 105150001493 its reverse (394100051501), we get a palindrome (499250052994).
The spelling of 105150001493 in words is "one hundred five billion, one hundred fifty million, one thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •