Base | Representation |
---|---|
bin | 10010110100000010… |
… | …10101001100111111 |
3 | 222001220100222222120 |
4 | 21122001111030333 |
5 | 131141124424043 |
6 | 4350123014023 |
7 | 505202364336 |
oct | 113201251477 |
9 | 28056328876 |
10 | 10100233023 |
11 | 4313355621 |
12 | 1b5a66a313 |
13 | c4c6b305a |
14 | 6bb5b4d1d |
15 | 3e1aab983 |
hex | 25a05533f |
10100233023 has 8 divisors (see below), whose sum is σ = 13467457200. Its totient is φ = 6733248768.
The previous prime is 10100232997. The next prime is 10100233037. The reversal of 10100233023 is 32033200101.
10100233023 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10100233023 - 216 = 10100167487 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10100232993 and 10100233011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10100233043) 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 7 ways as a sum of consecutive naturals, for example, 96783 + ... + 171951.
It is an arithmetic number, because the mean of its divisors is an integer number (1683432150).
Almost surely, 210100233023 is an apocalyptic number.
10100233023 is a deficient number, since it is larger than the sum of its proper divisors (3367224177).
10100233023 is an equidigital number, since it uses as much as digits as its factorization.
10100233023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119961.
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 10100233023 its reverse (32033200101), we get a palindrome (42133433124).
The spelling of 10100233023 in words is "ten billion, one hundred million, two hundred thirty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •