Base | Representation |
---|---|
bin | 100111111010101110010… |
… | …1111101000111110011001 |
3 | 201102110220202012012210101 |
4 | 1033311130233220332121 |
5 | 1204341244140320330 |
6 | 15400201112215401 |
7 | 1104236606006455 |
oct | 117653457507631 |
9 | 21373822165711 |
10 | 5486229229465 |
11 | 1825773413266 |
12 | 74732709a561 |
13 | 30a4702527ba |
14 | 14d76bb23665 |
15 | 97a994014ca |
hex | 4fd5cbe8f99 |
5486229229465 has 8 divisors (see below), whose sum is σ = 6583494997440. Its totient is φ = 4388970102192.
The previous prime is 5486229229399. The next prime is 5486229229519. The reversal of 5486229229465 is 5649229226845.
5486229229465 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5486229229465 - 213 = 5486229221273 is a prime.
It is a super-2 number, since 2×54862292294652 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5486229229397 and 5486229229406.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 386812 + ... + 3334978.
It is an arithmetic number, because the mean of its divisors is an integer number (822936874680).
Almost surely, 25486229229465 is an apocalyptic number.
It is an amenable number.
5486229229465 is a deficient number, since it is larger than the sum of its proper divisors (1097265767975).
5486229229465 is a wasteful number, since it uses less digits than its factorization.
5486229229465 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3320351.
The product of its digits is 149299200, while the sum is 64.
The spelling of 5486229229465 in words is "five trillion, four hundred eighty-six billion, two hundred twenty-nine million, two hundred twenty-nine thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •