Base | Representation |
---|---|
bin | 110000000111100010… |
… | …0011000101101011010 |
3 | 100212201101102122200210 |
4 | 1200033010120231122 |
5 | 3143110444220010 |
6 | 115245311511550 |
7 | 10315443463440 |
oct | 1401704305532 |
9 | 325641378623 |
10 | 103332023130 |
11 | 3a906262426 |
12 | 180398285b6 |
13 | 9989c2486b |
14 | 50037b4b90 |
15 | 2a4ba15b20 |
hex | 180f118b5a |
103332023130 has 32 divisors (see below), whose sum is σ = 283424978304. Its totient is φ = 23618748096.
The previous prime is 103332023017. The next prime is 103332023141. The reversal of 103332023130 is 31320233301.
103332023130 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 103332023097 and 103332023106.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 246028417 + ... + 246028836.
It is an arithmetic number, because the mean of its divisors is an integer number (8857030572).
Almost surely, 2103332023130 is an apocalyptic number.
103332023130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103332023130 is an abundant number, since it is smaller than the sum of its proper divisors (180092955174).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103332023130 is a wasteful number, since it uses less digits than its factorization.
103332023130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 492057270.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 103332023130 its reverse (31320233301), we get a palindrome (134652256431).
The spelling of 103332023130 in words is "one hundred three billion, three hundred thirty-two million, twenty-three thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •