Base | Representation |
---|---|
bin | 11111001000110100000011… |
… | …10110001111100111000000 |
3 | 22222102220121112112111102120 |
4 | 33210122001312033213000 |
5 | 32433323234030112113 |
6 | 401343504235044240 |
7 | 20264656356230154 |
oct | 1744320166174700 |
9 | 288386545474376 |
10 | 68472547113408 |
11 | 1a8aa053851809 |
12 | 781a5315a0680 |
13 | 2c28c19b42009 |
14 | 12ca136187064 |
15 | 7db1dc457a23 |
hex | 3e4681d8f9c0 |
68472547113408 has 224 divisors, whose sum is σ = 198599362910208. Its totient is φ = 20726931456000.
The previous prime is 68472547113407. The next prime is 68472547113463. The reversal of 68472547113408 is 80431174527486.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (68472547113407) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 33094983 + ... + 35103033.
Almost surely, 268472547113408 is an apocalyptic number.
68472547113408 is a gapful number since it is divisible by the number (68) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 68472547113408, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (99299681455104).
68472547113408 is an abundant number, since it is smaller than the sum of its proper divisors (130126815796800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68472547113408 is a wasteful number, since it uses less digits than its factorization.
68472547113408 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2008451 (or 2008441 counting only the distinct ones).
The product of its (nonzero) digits is 36126720, while the sum is 60.
The spelling of 68472547113408 in words is "sixty-eight trillion, four hundred seventy-two billion, five hundred forty-seven million, one hundred thirteen thousand, four hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.341 sec. • engine limits •