Base | Representation |
---|---|
bin | 11110100001110001101… |
… | …10110111110111100011 |
3 | 10201021110110012010120221 |
4 | 33100320312313313203 |
5 | 114141200014211211 |
6 | 2121511522543511 |
7 | 135532235200156 |
oct | 17207066676743 |
9 | 3637413163527 |
10 | 1048925928931 |
11 | 374935383501 |
12 | 14b357207b97 |
13 | 77bb466584a |
14 | 38aa8267c9d |
15 | 1c441b97c71 |
hex | f438db7de3 |
1048925928931 has 2 divisors, whose sum is σ = 1048925928932. Its totient is φ = 1048925928930.
The previous prime is 1048925928907. The next prime is 1048925928983. The reversal of 1048925928931 is 1398295298401.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1048925928931 - 25 = 1048925928899 is a prime.
It is a super-2 number, since 2×10489259289312 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1048925928931.
It is not a weakly prime, because it can be changed into another prime (1048925928131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 524462964465 + 524462964466.
It is an arithmetic number, because the mean of its divisors is an integer number (524462964466).
Almost surely, 21048925928931 is an apocalyptic number.
1048925928931 is a deficient number, since it is larger than the sum of its proper divisors (1).
1048925928931 is an equidigital number, since it uses as much as digits as its factorization.
1048925928931 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11197440, while the sum is 61.
The spelling of 1048925928931 in words is "one trillion, forty-eight billion, nine hundred twenty-five million, nine hundred twenty-eight thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •