Base | Representation |
---|---|
bin | 10011000011100001… |
… | …01111101111011001 |
3 | 222101221202002002202 |
4 | 21201300233233121 |
5 | 131422401244001 |
6 | 4411042335545 |
7 | 511340304116 |
oct | 114160575731 |
9 | 28357662082 |
10 | 10230103001 |
11 | 437a698888 |
12 | 1b9605a5b5 |
13 | c705845b1 |
14 | 6d093d90d |
15 | 3ed1b196b |
hex | 261c2fbd9 |
10230103001 has 6 divisors (see below), whose sum is σ = 10694229210. Its totient is φ = 9785315408.
The previous prime is 10230102979. The next prime is 10230103003. The reversal of 10230103001 is 10030103201.
It can be written as a sum of positive squares in only one way, i.e., 9420643600 + 809459401 = 97060^2 + 28451^2 .
It is not a de Polignac number, because 10230103001 - 226 = 10162994137 is a prime.
It is a super-2 number, since 2×102301030012 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10230103003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 9668756 + ... + 9669813.
It is an arithmetic number, because the mean of its divisors is an integer number (1782371535).
Almost surely, 210230103001 is an apocalyptic number.
It is an amenable number.
10230103001 is a deficient number, since it is larger than the sum of its proper divisors (464126209).
10230103001 is an equidigital number, since it uses as much as digits as its factorization.
10230103001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19338615 (or 19338592 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 11.
Adding to 10230103001 its reverse (10030103201), we get a palindrome (20260206202).
The spelling of 10230103001 in words is "ten billion, two hundred thirty million, one hundred three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •