Base | Representation |
---|---|
bin | 1001001110110101001111… |
… | …1001010110110011101001 |
3 | 1022221100222220002102012011 |
4 | 2103231103321112303221 |
5 | 2312301022301440001 |
6 | 33331011510115521 |
7 | 2065225516115554 |
oct | 223552371266351 |
9 | 38840886072164 |
10 | 10150415265001 |
11 | 3263848883990 |
12 | 117b27564bba1 |
13 | 5882457623cb |
14 | 2713d5ad969b |
15 | 1290801edd51 |
hex | 93b53e56ce9 |
10150415265001 has 4 divisors (see below), whose sum is σ = 11073180289104. Its totient is φ = 9227650240900.
The previous prime is 10150415264963. The next prime is 10150415265013. The reversal of 10150415265001 is 10056251405101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10150415265001 - 215 = 10150415232233 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10150415265061) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 461382512035 + ... + 461382512056.
It is an arithmetic number, because the mean of its divisors is an integer number (2768295072276).
Almost surely, 210150415265001 is an apocalyptic number.
10150415265001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10150415265001 is a deficient number, since it is larger than the sum of its proper divisors (922765024103).
10150415265001 is an equidigital number, since it uses as much as digits as its factorization.
10150415265001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 922765024102.
The product of its (nonzero) digits is 6000, while the sum is 31.
The spelling of 10150415265001 in words is "ten trillion, one hundred fifty billion, four hundred fifteen million, two hundred sixty-five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •