Base | Representation |
---|---|
bin | 1101101000011011110… |
… | …01011011110110100011 |
3 | 1122202222112020202022001 |
4 | 12310031321123312203 |
5 | 30133222424022423 |
6 | 555101203224431 |
7 | 45561002241106 |
oct | 6641571336643 |
9 | 1582875222261 |
10 | 468384595363 |
11 | 170705991013 |
12 | 76939078117 |
13 | 352261b8359 |
14 | 1895443473d |
15 | c2b52b5cad |
hex | 6d0de5bda3 |
468384595363 has 4 divisors (see below), whose sum is σ = 468710089920. Its totient is φ = 468059100808.
The previous prime is 468384595351. The next prime is 468384595369. The reversal of 468384595363 is 363595483864.
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 468384595363 - 29 = 468384594851 is a prime.
It is a super-2 number, since 2×4683845953632 (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 = 468384595295 and 468384595304.
It is not an unprimeable number, because it can be changed into a prime (468384595369) 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 3 ways as a sum of consecutive naturals, for example, 162745120 + ... + 162747997.
It is an arithmetic number, because the mean of its divisors is an integer number (117177522480).
Almost surely, 2468384595363 is an apocalyptic number.
468384595363 is a deficient number, since it is larger than the sum of its proper divisors (325494557).
468384595363 is a wasteful number, since it uses less digits than its factorization.
468384595363 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 325494556.
The product of its digits is 223948800, while the sum is 64.
The spelling of 468384595363 in words is "four hundred sixty-eight billion, three hundred eighty-four million, five hundred ninety-five thousand, three hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •