Base | Representation |
---|---|
bin | 11111001101000010000… |
… | …11100110011101100101 |
3 | 10210111101220100221111111 |
4 | 33212201003212131211 |
5 | 120031230111314303 |
6 | 2140312144305021 |
7 | 140313564362614 |
oct | 17464103463545 |
9 | 3714356327444 |
10 | 1072148932453 |
11 | 3837721377a5 |
12 | 153958612171 |
13 | 7a1459a4551 |
14 | 39c6c60587b |
15 | 1cd50857b6d |
hex | f9a10e6765 |
1072148932453 has 2 divisors, whose sum is σ = 1072148932454. Its totient is φ = 1072148932452.
The previous prime is 1072148932417. The next prime is 1072148932469. The reversal of 1072148932453 is 3542398412701.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 814798686244 + 257350246209 = 902662^2 + 507297^2 .
It is a cyclic number.
It is not a de Polignac number, because 1072148932453 - 233 = 1063558997861 is a prime.
It is a super-2 number, since 2×10721489324532 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1072148932397 and 1072148932406.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1072148962453) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 536074466226 + 536074466227.
It is an arithmetic number, because the mean of its divisors is an integer number (536074466227).
Almost surely, 21072148932453 is an apocalyptic number.
It is an amenable number.
1072148932453 is a deficient number, since it is larger than the sum of its proper divisors (1).
1072148932453 is an equidigital number, since it uses as much as digits as its factorization.
1072148932453 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1451520, while the sum is 49.
The spelling of 1072148932453 in words is "one trillion, seventy-two billion, one hundred forty-eight million, nine hundred thirty-two thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •