Base | Representation |
---|---|
bin | 10010111010000000… |
… | …11000010101100001 |
3 | 222012101121110000222 |
4 | 21131000120111201 |
5 | 131241440042421 |
6 | 4355112252425 |
7 | 506351154104 |
oct | 113500302541 |
9 | 28171543028 |
10 | 10150315361 |
11 | 433965218a |
12 | 1b733a1115 |
13 | c59b99a84 |
14 | 6c40d073b |
15 | 3e61a0cab |
hex | 25d018561 |
10150315361 has 8 divisors (see below), whose sum is σ = 10235864064. Its totient is φ = 10064854800.
The previous prime is 10150315349. The next prime is 10150315369. The reversal of 10150315361 is 16351305101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10150315361 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 10150315361.
It is not an unprimeable number, because it can be changed into a prime (10150315369) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 220406 + ... + 262448.
It is an arithmetic number, because the mean of its divisors is an integer number (1279483008).
Almost surely, 210150315361 is an apocalyptic number.
It is an amenable number.
10150315361 is a deficient number, since it is larger than the sum of its proper divisors (85548703).
10150315361 is a wasteful number, since it uses less digits than its factorization.
10150315361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44071.
The product of its (nonzero) digits is 1350, while the sum is 26.
The spelling of 10150315361 in words is "ten billion, one hundred fifty million, three hundred fifteen thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •