Base | Representation |
---|---|
bin | 111100110011110… |
… | …111100110001110 |
3 | 2122002202001111102 |
4 | 330303313212032 |
5 | 4042134330110 |
6 | 245123023102 |
7 | 34165545401 |
oct | 7463674616 |
9 | 2562661442 |
10 | 1020230030 |
11 | 483990a16 |
12 | 24580aa92 |
13 | 1334a1211 |
14 | 996d5d38 |
15 | 5e87a5a5 |
hex | 3ccf798e |
1020230030 has 16 divisors (see below), whose sum is σ = 1846563264. Its totient is φ = 405836640.
The previous prime is 1020230009. The next prime is 1020230033. The reversal of 1020230030 is 300320201.
It is a super-2 number, since 2×10202300302 = 2081738628227601800, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1020229993 and 1020230020.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020230033) 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, 280022 + ... + 283641.
It is an arithmetic number, because the mean of its divisors is an integer number (115410204).
Almost surely, 21020230030 is an apocalyptic number.
1020230030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1020230030 is a deficient number, since it is larger than the sum of its proper divisors (826333234).
1020230030 is a wasteful number, since it uses less digits than its factorization.
1020230030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 563851.
The product of its (nonzero) digits is 36, while the sum is 11.
The square root of 1020230030 is about 31941.0399016688. The cubic root of 1020230030 is about 1006.6983749253.
Adding to 1020230030 its reverse (300320201), we get a palindrome (1320550231).
The spelling of 1020230030 in words is "one billion, twenty million, two hundred thirty thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •