Base | Representation |
---|---|
bin | 11101011001101100111… |
… | …00000011111010000110 |
3 | 10120120120201011210120100 |
4 | 32230312130003322012 |
5 | 113022423020442022 |
6 | 2052032112344530 |
7 | 132662312521404 |
oct | 16546634037206 |
9 | 3516521153510 |
10 | 1010230640262 |
11 | 35a488950398 |
12 | 143958245146 |
13 | 743589aa82c |
14 | 36c77086474 |
15 | 1b4299d21ac |
hex | eb36703e86 |
1010230640262 has 96 divisors (see below), whose sum is σ = 2336894632800. Its totient is φ = 314475250176.
The previous prime is 1010230640249. The next prime is 1010230640299. The reversal of 1010230640262 is 2620460320101.
1010230640262 is a `hidden beast` number, since 1 + 0 + 10 + 2 + 3 + 0 + 640 + 2 + 6 + 2 = 666.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 49247664 + ... + 49268172.
It is an arithmetic number, because the mean of its divisors is an integer number (24342652425).
Almost surely, 21010230640262 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1010230640262, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1168447316400).
1010230640262 is an abundant number, since it is smaller than the sum of its proper divisors (1326663992538).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1010230640262 is a wasteful number, since it uses less digits than its factorization.
1010230640262 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22582 (or 22579 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 1010230640262 its reverse (2620460320101), we get a palindrome (3630690960363).
The spelling of 1010230640262 in words is "one trillion, ten billion, two hundred thirty million, six hundred forty thousand, two hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •