Base | Representation |
---|---|
bin | 11101000111011010100… |
… | …01011101101110000001 |
3 | 10112122020111220201000221 |
4 | 32203231101131232001 |
5 | 112342321234103131 |
6 | 2043330010343041 |
7 | 132164112550435 |
oct | 16435521355601 |
9 | 3478214821027 |
10 | 1000413191041 |
11 | 3563001904a0 |
12 | 141a7842aa81 |
13 | 73452a78294 |
14 | 365c52829c5 |
15 | 1b052b83411 |
hex | e8ed45db81 |
1000413191041 has 4 divisors (see below), whose sum is σ = 1091359844784. Its totient is φ = 909466537300.
The previous prime is 1000413191033. The next prime is 1000413191059. The reversal of 1000413191041 is 1401913140001.
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 1000413191041 - 23 = 1000413191033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1000413190997 and 1000413191015.
It is not an unprimeable number, because it can be changed into a prime (1000413191441) 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, 45473326855 + ... + 45473326876.
It is an arithmetic number, because the mean of its divisors is an integer number (272839961196).
Almost surely, 21000413191041 is an apocalyptic number.
1000413191041 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1000413191041 is a deficient number, since it is larger than the sum of its proper divisors (90946653743).
1000413191041 is an equidigital number, since it uses as much as digits as its factorization.
1000413191041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90946653742.
The product of its (nonzero) digits is 432, while the sum is 25.
The spelling of 1000413191041 in words is "one trillion, four hundred thirteen million, one hundred ninety-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •