Base | Representation |
---|---|
bin | 10101110101011001111100… |
… | …00010100100100111110101 |
3 | 20022000010202200111000122121 |
4 | 22322230332002210213311 |
5 | 22243132123421414134 |
6 | 250041314150355541 |
7 | 13053634403215153 |
oct | 1272547602444765 |
9 | 208003680430577 |
10 | 48014480263669 |
11 | 14331910412767 |
12 | 547564035bbb1 |
13 | 20a399113247a |
14 | bbdcadd2a3d3 |
15 | 583e78030ab4 |
hex | 2bab3e0a49f5 |
48014480263669 has 2 divisors, whose sum is σ = 48014480263670. Its totient is φ = 48014480263668.
The previous prime is 48014480263663. The next prime is 48014480263709. The reversal of 48014480263669 is 96636208441084.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 42116076296100 + 5898403967569 = 6489690^2 + 2428663^2 .
It is a cyclic number.
It is not a de Polignac number, because 48014480263669 - 23 = 48014480263661 is a prime.
It is a super-3 number, since 3×480144802636693 (a number of 42 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (48014480263661) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 24007240131834 + 24007240131835.
It is an arithmetic number, because the mean of its divisors is an integer number (24007240131835).
Almost surely, 248014480263669 is an apocalyptic number.
It is an amenable number.
48014480263669 is a deficient number, since it is larger than the sum of its proper divisors (1).
48014480263669 is an equidigital number, since it uses as much as digits as its factorization.
48014480263669 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 47775744, while the sum is 61.
The spelling of 48014480263669 in words is "forty-eight trillion, fourteen billion, four hundred eighty million, two hundred sixty-three thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •