Base | Representation |
---|---|
bin | 111100110110110… |
… | …110010000111000 |
3 | 2122011012201210020 |
4 | 330312312100320 |
5 | 4042334323000 |
6 | 245151450440 |
7 | 34205310312 |
oct | 7466662070 |
9 | 2564181706 |
10 | 1021011000 |
11 | 484374749 |
12 | 245b26a20 |
13 | 1336b5829 |
14 | 9985a7b2 |
15 | 5e981ba0 |
hex | 3cdb6438 |
1021011000 has 64 divisors (see below), whose sum is σ = 3185563680. Its totient is φ = 272268800.
The previous prime is 1021010993. The next prime is 1021011001. The reversal of 1021011000 is 1101201.
It is a Harshad number since it is a multiple of its sum of digits (6).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is a self number, because there is not a number n which added to its sum of digits gives 1021011000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1021011001) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 167169 + ... + 173168.
Almost surely, 21021011000 is an apocalyptic number.
1021011000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1021011000 is an abundant number, since it is smaller than the sum of its proper divisors (2164552680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1021011000 is a wasteful number, since it uses less digits than its factorization.
1021011000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 340361 (or 340347 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 6.
The square root of 1021011000 is about 31953.2627442019. The cubic root of 1021011000 is about 1006.9551799868.
Adding to 1021011000 its reverse (1101201), we get a palindrome (1022112201).
The spelling of 1021011000 in words is "one billion, twenty-one million, eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •