Base | Representation |
---|---|
bin | 101000010000110110… |
… | …1110100001110100011 |
3 | 22021011220011022212021 |
4 | 1100201231310032203 |
5 | 2404040020120301 |
6 | 103415501042311 |
7 | 6150453261040 |
oct | 1204155641643 |
9 | 267156138767 |
10 | 86465004451 |
11 | 33740271671 |
12 | 14910b56397 |
13 | 81cc651c37 |
14 | 42836301c7 |
15 | 23b0d5a8a1 |
hex | 1421b743a3 |
86465004451 has 8 divisors (see below), whose sum is σ = 101115221504. Its totient is φ = 72389305800.
The previous prime is 86465004419. The next prime is 86465004469. The reversal of 86465004451 is 15440056468.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 86465004451 - 25 = 86465004419 is a prime.
It is a super-2 number, since 2×864650044512 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (43).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 86465004398 and 86465004407.
It is not an unprimeable number, because it can be changed into a prime (86465004151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 143629275 + ... + 143629876.
It is an arithmetic number, because the mean of its divisors is an integer number (12639402688).
Almost surely, 286465004451 is an apocalyptic number.
86465004451 is a deficient number, since it is larger than the sum of its proper divisors (14650217053).
86465004451 is a wasteful number, since it uses less digits than its factorization.
86465004451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 287259201.
The product of its (nonzero) digits is 460800, while the sum is 43.
The spelling of 86465004451 in words is "eighty-six billion, four hundred sixty-five million, four thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •