Base | Representation |
---|---|
bin | 11110110111001100101… |
… | …01101111100101110101 |
3 | 10202101010221101022220011 |
4 | 33123212111233211311 |
5 | 114333223130230303 |
6 | 2131053030140221 |
7 | 136420232541400 |
oct | 17334625574565 |
9 | 3671127338804 |
10 | 1060426414453 |
11 | 3797a707a49a |
12 | 1516267b1671 |
13 | 78cc8185273 |
14 | 394797b8d37 |
15 | 1c8b664916d |
hex | f6e656f975 |
1060426414453 has 6 divisors (see below), whose sum is σ = 1233557257686. Its totient is φ = 908936926632.
The previous prime is 1060426414451. The next prime is 1060426414493. The reversal of 1060426414453 is 3544146240601.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 1001524580644 + 58901833809 = 1000762^2 + 242697^2 .
It is not a de Polignac number, because 1060426414453 - 21 = 1060426414451 is a prime.
It is a super-2 number, since 2×10604264144532 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1060426414451) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 10820677650 + ... + 10820677747.
It is an arithmetic number, because the mean of its divisors is an integer number (205592876281).
Almost surely, 21060426414453 is an apocalyptic number.
It is an amenable number.
1060426414453 is a deficient number, since it is larger than the sum of its proper divisors (173130843233).
1060426414453 is an equidigital number, since it uses as much as digits as its factorization.
1060426414453 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21641355411 (or 21641355404 counting only the distinct ones).
The product of its (nonzero) digits is 276480, while the sum is 40.
The spelling of 1060426414453 in words is "one trillion, sixty billion, four hundred twenty-six million, four hundred fourteen thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •