Base | Representation |
---|---|
bin | 1110000011111011011… |
… | …11001011111110011001 |
3 | 1201012002021011122012221 |
4 | 13001331233023332121 |
5 | 30403440314441334 |
6 | 1005542032304041 |
7 | 46622543020054 |
oct | 7017557137631 |
9 | 1635067148187 |
10 | 483145858969 |
11 | 1769a0272924 |
12 | 797786a2021 |
13 | 36739436767 |
14 | 19554a71a9b |
15 | c87b16d8b4 |
hex | 707dbcbf99 |
483145858969 has 4 divisors (see below), whose sum is σ = 493425558144. Its totient is φ = 472866159796.
The previous prime is 483145858927. The next prime is 483145859003. The reversal of 483145858969 is 969858541384.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 483145858969 - 215 = 483145826201 is a prime.
It is a super-2 number, since 2×4831458589692 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 483145858898 and 483145858907.
It is not an unprimeable number, because it can be changed into a prime (483145858369) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5139849517 + ... + 5139849610.
It is an arithmetic number, because the mean of its divisors is an integer number (123356389536).
Almost surely, 2483145858969 is an apocalyptic number.
It is an amenable number.
483145858969 is a deficient number, since it is larger than the sum of its proper divisors (10279699175).
483145858969 is a wasteful number, since it uses less digits than its factorization.
483145858969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10279699174.
The product of its digits is 298598400, while the sum is 70.
The spelling of 483145858969 in words is "four hundred eighty-three billion, one hundred forty-five million, eight hundred fifty-eight thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •