Base | Representation |
---|---|
bin | 1110001000101000001… |
… | …01011111101101011011 |
3 | 1201102121001120101020011 |
4 | 13010110011133231123 |
5 | 30424122040224441 |
6 | 1011040220542351 |
7 | 50042212226416 |
oct | 7042405375533 |
9 | 1642531511204 |
10 | 485668289371 |
11 | 177a750a7151 |
12 | 7a1613b19b7 |
13 | 36a4bbba625 |
14 | 19713a80b7d |
15 | c97782a581 |
hex | 711415fb5b |
485668289371 has 4 divisors (see below), whose sum is σ = 498794459392. Its totient is φ = 472542119352.
The previous prime is 485668289333. The next prime is 485668289399. The reversal of 485668289371 is 173982866584.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 485668289371 - 27 = 485668289243 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 485668289297 and 485668289306.
It is not an unprimeable number, because it can be changed into a prime (485668289471) 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, 6563084955 + ... + 6563085028.
It is an arithmetic number, because the mean of its divisors is an integer number (124698614848).
Almost surely, 2485668289371 is an apocalyptic number.
485668289371 is a deficient number, since it is larger than the sum of its proper divisors (13126170021).
485668289371 is a wasteful number, since it uses less digits than its factorization.
485668289371 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13126170020.
The product of its digits is 139345920, while the sum is 67.
The spelling of 485668289371 in words is "four hundred eighty-five billion, six hundred sixty-eight million, two hundred eighty-nine thousand, three hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •