Base | Representation |
---|---|
bin | 1001010011011101101110… |
… | …0001110011011001000010 |
3 | 1100012222102022012011121122 |
4 | 2110313123201303121002 |
5 | 2320102020023001310 |
6 | 33431332555352242 |
7 | 2104043640665045 |
oct | 224673341633102 |
9 | 40188368164548 |
10 | 10230000203330 |
11 | 3294578467a96 |
12 | 1192786452682 |
13 | 5928b98b11ab |
14 | 2751c56acc5c |
15 | 12b18c031555 |
hex | 94ddb873642 |
10230000203330 has 8 divisors (see below), whose sum is σ = 18414000366012. Its totient is φ = 4092000081328.
The previous prime is 10230000203323. The next prime is 10230000203447. The reversal of 10230000203330 is 3330200003201.
10230000203330 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 9950031170689 + 279969032641 = 3154367^2 + 529121^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 10230000203299 and 10230000203308.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 511500010157 + ... + 511500010176.
Almost surely, 210230000203330 is an apocalyptic number.
10230000203330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10230000203330 is a deficient number, since it is larger than the sum of its proper divisors (8184000162682).
10230000203330 is a wasteful number, since it uses less digits than its factorization.
10230000203330 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1023000020340.
The product of its (nonzero) digits is 324, while the sum is 17.
Adding to 10230000203330 its reverse (3330200003201), we get a palindrome (13560200206531).
The spelling of 10230000203330 in words is "ten trillion, two hundred thirty billion, two hundred three thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •