Base | Representation |
---|---|
bin | 10011110001011011… |
… | …00011000000101111 |
3 | 1000101210021000010010 |
4 | 21320231203000233 |
5 | 133214433443044 |
6 | 4513155144303 |
7 | 524024130123 |
oct | 117055430057 |
9 | 30353230103 |
10 | 10615140399 |
11 | 4557a74106 |
12 | 2082ba5093 |
13 | 1002287586 |
14 | 729b2b583 |
15 | 421dbbbb9 |
hex | 278b6302f |
10615140399 has 4 divisors (see below), whose sum is σ = 14153520536. Its totient is φ = 7076760264.
The previous prime is 10615140379. The next prime is 10615140409. The reversal of 10615140399 is 99304151601.
10615140399 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 10615140399 - 28 = 10615140143 is a prime.
It is a super-2 number, since 2×106151403992 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10615140379) 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 3 ways as a sum of consecutive naturals, for example, 1769190064 + ... + 1769190069.
It is an arithmetic number, because the mean of its divisors is an integer number (3538380134).
Almost surely, 210615140399 is an apocalyptic number.
10615140399 is a deficient number, since it is larger than the sum of its proper divisors (3538380137).
10615140399 is an equidigital number, since it uses as much as digits as its factorization.
10615140399 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3538380136.
The product of its (nonzero) digits is 29160, while the sum is 39.
The spelling of 10615140399 in words is "ten billion, six hundred fifteen million, one hundred forty thousand, three hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •