Base | Representation |
---|---|
bin | 1011010000101111… |
… | …1010011101001010 |
3 | 21210200100102110000 |
4 | 2310023322131022 |
5 | 22142343200043 |
6 | 1215545503430 |
7 | 134625155631 |
oct | 26413723512 |
9 | 7720312400 |
10 | 3023021898 |
11 | 1311465106 |
12 | 7044a1b76 |
13 | 3923b5270 |
14 | 2096ba518 |
15 | 12a5e02d3 |
hex | b42fa74a |
3023021898 has 80 divisors (see below), whose sum is σ = 7330520736. Its totient is φ = 925616160.
The previous prime is 3023021863. The next prime is 3023021899. The reversal of 3023021898 is 8981203203.
It is a happy number.
It is a super-2 number, since 2×30230218982 = 18277322791575044808, which contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (3023021899) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 440965 + ... + 447767.
Almost surely, 23023021898 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3023021898, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3665260368).
3023021898 is an abundant number, since it is smaller than the sum of its proper divisors (4307498838).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3023021898 is a wasteful number, since it uses less digits than its factorization.
3023021898 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7041 (or 7032 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 36.
The square root of 3023021898 is about 54982.0143137736. The cubic root of 3023021898 is about 1445.9294313110.
The spelling of 3023021898 in words is "three billion, twenty-three million, twenty-one thousand, eight hundred ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •