Base | Representation |
---|---|
bin | 11110110001010100011… |
… | …00110000000011110011 |
3 | 10202001222221220211121020 |
4 | 33120222030300003303 |
5 | 114310242101043332 |
6 | 2125411512030523 |
7 | 136246064133336 |
oct | 17305214600363 |
9 | 3661887824536 |
10 | 1057269940467 |
11 | 378427355904 |
12 | 150aa5692443 |
13 | 78914246190 |
14 | 3925a4c061d |
15 | 1c77e49782c |
hex | f62a3300f3 |
1057269940467 has 16 divisors (see below), whose sum is σ = 1532319344640. Its totient is φ = 644547020832.
The previous prime is 1057269940421. The next prime is 1057269940469. The reversal of 1057269940467 is 7640499627501.
It is not a de Polignac number, because 1057269940467 - 27 = 1057269940339 is a prime.
It is a super-2 number, since 2×10572699404672 (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 1057269940467.
It is not an unprimeable number, because it can be changed into a prime (1057269940469) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 126675667 + ... + 126684012.
It is an arithmetic number, because the mean of its divisors is an integer number (95769959040).
Almost surely, 21057269940467 is an apocalyptic number.
1057269940467 is a deficient number, since it is larger than the sum of its proper divisors (475049404173).
1057269940467 is a wasteful number, since it uses less digits than its factorization.
1057269940467 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 253359802.
The product of its (nonzero) digits is 22861440, while the sum is 60.
The spelling of 1057269940467 in words is "one trillion, fifty-seven billion, two hundred sixty-nine million, nine hundred forty thousand, four hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •