Base | Representation |
---|---|
bin | 1011001101111101… |
… | …0001110100001000 |
3 | 21202212022221221222 |
4 | 2303133101310020 |
5 | 22131344233341 |
6 | 1214451021212 |
7 | 134423543540 |
oct | 26337216410 |
9 | 7685287858 |
10 | 3011321096 |
11 | 13058a3123 |
12 | 70059a808 |
13 | 38cb49504 |
14 | 207d12320 |
15 | 12957d44b |
hex | b37d1d08 |
3011321096 has 64 divisors (see below), whose sum is σ = 6958224000. Its totient is φ = 1192803840.
The previous prime is 3011321063. The next prime is 3011321113. The reversal of 3011321096 is 6901231103.
3011321096 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9110 + ... + 78138.
It is an arithmetic number, because the mean of its divisors is an integer number (108722250).
Almost surely, 23011321096 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3011321096, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3479112000).
3011321096 is an abundant number, since it is smaller than the sum of its proper divisors (3946902904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3011321096 is a wasteful number, since it uses less digits than its factorization.
3011321096 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 69102 (or 69098 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 26.
The square root of 3011321096 is about 54875.5054281963. The cubic root of 3011321096 is about 1444.0614980855.
Adding to 3011321096 its reverse (6901231103), we get a palindrome (9912552199).
The spelling of 3011321096 in words is "three billion, eleven million, three hundred twenty-one thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •