Base | Representation |
---|---|
bin | 11001110011001000… |
… | …01110100101101001 |
3 | 1022202021112110122222 |
4 | 30321210032211221 |
5 | 211331234401022 |
6 | 10210220323425 |
7 | 1000143002651 |
oct | 147144164551 |
9 | 38667473588 |
10 | 13850700137 |
11 | 59683a501a |
12 | 28266a3575 |
13 | 13c96c6871 |
14 | 955731361 |
15 | 560e91242 |
hex | 33990e969 |
13850700137 has 8 divisors (see below), whose sum is σ = 14061674496. Its totient is φ = 13641318432.
The previous prime is 13850700113. The next prime is 13850700163. The reversal of 13850700137 is 73100705831.
13850700137 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13850700137 - 28 = 13850699881 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13850700097 and 13850700106.
It is not an unprimeable number, because it can be changed into a prime (13850700107) 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 7 ways as a sum of consecutive naturals, for example, 380633 + ... + 415430.
It is an arithmetic number, because the mean of its divisors is an integer number (1757709312).
Almost surely, 213850700137 is an apocalyptic number.
It is an amenable number.
13850700137 is a deficient number, since it is larger than the sum of its proper divisors (210974359).
13850700137 is a wasteful number, since it uses less digits than its factorization.
13850700137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 796327.
The product of its (nonzero) digits is 17640, while the sum is 35.
The spelling of 13850700137 in words is "thirteen billion, eight hundred fifty million, seven hundred thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •