Base | Representation |
---|---|
bin | 101111111110010101… |
… | …0010101000000011010 |
3 | 100211220212022221012101 |
4 | 1133330222111000122 |
5 | 3141442414433310 |
6 | 115154520434014 |
7 | 10305003525316 |
oct | 1377452250032 |
9 | 324825287171 |
10 | 103023202330 |
11 | 3a767a03824 |
12 | 17b7231890a |
13 | 993ac58b69 |
14 | 4db4786b46 |
15 | 2a2e86343a |
hex | 17fca9501a |
103023202330 has 16 divisors (see below), whose sum is σ = 185510929824. Its totient is φ = 41193910800.
The previous prime is 103023202297. The next prime is 103023202339. The reversal of 103023202330 is 33202320301.
It is a happy number.
It is a super-2 number, since 2×1030232023302 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103023202298 and 103023202307.
It is not an unprimeable number, because it can be changed into a prime (103023202339) 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 7 ways as a sum of consecutive naturals, for example, 1893096 + ... + 1946755.
It is an arithmetic number, because the mean of its divisors is an integer number (11594433114).
Almost surely, 2103023202330 is an apocalyptic number.
103023202330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103023202330 is a deficient number, since it is larger than the sum of its proper divisors (82487727494).
103023202330 is a wasteful number, since it uses less digits than its factorization.
103023202330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3842541.
The product of its (nonzero) digits is 648, while the sum is 19.
Adding to 103023202330 its reverse (33202320301), we get a palindrome (136225522631).
The spelling of 103023202330 in words is "one hundred three billion, twenty-three million, two hundred two thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •