Base | Representation |
---|---|
bin | 1001100110010001110000110… |
… | …1111100100011100011011100 |
3 | 10021120102010011202101211122101 |
4 | 2121210130031330203203130 |
5 | 1202011320041411014211 |
6 | 10352244530243254444 |
7 | 262156265234623063 |
oct | 23144341574434334 |
9 | 3246363152354571 |
10 | 675405316110556 |
11 | 186228871189519 |
12 | 639020a997a424 |
13 | 22cb35a93c3565 |
14 | bcadb126a91da |
15 | 5313c978775c1 |
hex | 266470df238dc |
675405316110556 has 12 divisors (see below), whose sum is σ = 1181972270878560. Its totient is φ = 337698953002400.
The previous prime is 675405316110433. The next prime is 675405316110599. The reversal of 675405316110556 is 655011613504576.
675405316110556 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×6754053161105562 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 675405316110497 and 675405316110506.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 925853041 + ... + 926582248.
It is an arithmetic number, because the mean of its divisors is an integer number (98497689239880).
Almost surely, 2675405316110556 is an apocalyptic number.
It is an amenable number.
675405316110556 is a deficient number, since it is larger than the sum of its proper divisors (506566954768004).
675405316110556 is a wasteful number, since it uses less digits than its factorization.
675405316110556 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1852526444 (or 1852526442 counting only the distinct ones).
The product of its (nonzero) digits is 11340000, while the sum is 55.
The spelling of 675405316110556 in words is "six hundred seventy-five trillion, four hundred five billion, three hundred sixteen million, one hundred ten thousand, five hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •