Base | Representation |
---|---|
bin | 110000000100011111… |
… | …1001111101001110111 |
3 | 100212110021110221202122 |
4 | 1200020333033221313 |
5 | 3142403340341043 |
6 | 115231225230155 |
7 | 10313064424115 |
oct | 1401077175167 |
9 | 325407427678 |
10 | 103230012023 |
11 | 3a863717a26 |
12 | 1800b63235b |
13 | 9971a58868 |
14 | 4dd401cab5 |
15 | 2a42ab5368 |
hex | 1808fcfa77 |
103230012023 has 8 divisors (see below), whose sum is σ = 107557942800. Its totient is φ = 98953299648.
The previous prime is 103230011987. The next prime is 103230012049. The reversal of 103230012023 is 320210032301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 103230012023 - 212 = 103230007927 is a prime.
It is a super-3 number, since 3×1032300120233 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103230011992 and 103230012010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103230012623) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12800486 + ... + 12808547.
It is an arithmetic number, because the mean of its divisors is an integer number (13444742850).
Almost surely, 2103230012023 is an apocalyptic number.
103230012023 is a deficient number, since it is larger than the sum of its proper divisors (4327930777).
103230012023 is a wasteful number, since it uses less digits than its factorization.
103230012023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25609201.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 103230012023 its reverse (320210032301), we get a palindrome (423440044324).
The spelling of 103230012023 in words is "one hundred three billion, two hundred thirty million, twelve thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •