Base | Representation |
---|---|
bin | 1000000101111111111… |
… | …0110110000101011111 |
3 | 111021220120201110101120 |
4 | 2001133332312011133 |
5 | 4234233102412310 |
6 | 143513420142023 |
7 | 13021525144434 |
oct | 2013776660537 |
9 | 437816643346 |
10 | 139049263455 |
11 | 53a74758763 |
12 | 22b47397913 |
13 | 1015c912bab |
14 | 6a31265b8b |
15 | 393c521b70 |
hex | 205ffb615f |
139049263455 has 32 divisors (see below), whose sum is σ = 222973304256. Its totient is φ = 73994932224.
The previous prime is 139049263433. The next prime is 139049263459. The reversal of 139049263455 is 554362940931.
It is not a de Polignac number, because 139049263455 - 26 = 139049263391 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 139049263398 and 139049263407.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (139049263459) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 20896909 + ... + 20903561.
It is an arithmetic number, because the mean of its divisors is an integer number (6967915758).
Almost surely, 2139049263455 is an apocalyptic number.
139049263455 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
139049263455 is a deficient number, since it is larger than the sum of its proper divisors (83924040801).
139049263455 is a wasteful number, since it uses less digits than its factorization.
139049263455 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9547.
The product of its (nonzero) digits is 3499200, while the sum is 51.
The spelling of 139049263455 in words is "one hundred thirty-nine billion, forty-nine million, two hundred sixty-three thousand, four hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •