Base | Representation |
---|---|
bin | 111111100001111101… |
… | …011110000101000110 |
3 | 20112002001111022000000 |
4 | 333201331132011012 |
5 | 2104201131401110 |
6 | 51200542502130 |
7 | 4633305105042 |
oct | 774175360506 |
9 | 215061438000 |
10 | 68215497030 |
11 | 26a2596262a |
12 | 11279294946 |
13 | 6581822235 |
14 | 3431a15022 |
15 | 1b93b191c0 |
hex | fe1f5e146 |
68215497030 has 112 divisors (see below), whose sum is σ = 184223715984. Its totient is φ = 18178344000.
The previous prime is 68215497017. The next prime is 68215497067. The reversal of 68215497030 is 3079451286.
68215497030 is a `hidden beast` number, since 6 + 8 + 2 + 1 + 549 + 70 + 30 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 16407712 + ... + 16411868.
It is an arithmetic number, because the mean of its divisors is an integer number (1644854607).
It is a 1-persistent number, because it is pandigital, but 2⋅68215497030 = 136430994060 is not.
Almost surely, 268215497030 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 68215497030, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (92111857992).
68215497030 is an abundant number, since it is smaller than the sum of its proper divisors (116008218954).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68215497030 is a wasteful number, since it uses less digits than its factorization.
68215497030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6433 (or 6418 counting only the distinct ones).
The product of its (nonzero) digits is 362880, while the sum is 45.
The spelling of 68215497030 in words is "sixty-eight billion, two hundred fifteen million, four hundred ninety-seven thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •