Base | Representation |
---|---|
bin | 11011010010011010001010… |
… | …101000101010111100011111 |
3 | 120201221001201200100120202002 |
4 | 123102122022220222330133 |
5 | 111212240143314233203 |
6 | 1103124520201352515 |
7 | 34164413503264502 |
oct | 3322321250527437 |
9 | 521831650316662 |
10 | 120012302102303 |
11 | 3526aa27905806 |
12 | 1156323119873b |
13 | 51c715b047150 |
14 | 218c8aac4b139 |
15 | dd1bde69cd88 |
hex | 6d268aa2af1f |
120012302102303 has 32 divisors (see below), whose sum is σ = 142758289175040. Its totient is φ = 99930801801600.
The previous prime is 120012302102291. The next prime is 120012302102327. The reversal of 120012302102303 is 303201203210021.
It is a cyclic number.
It is not a de Polignac number, because 120012302102303 - 236 = 119943582625567 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120012302102333) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 160564973 + ... + 161310678.
It is an arithmetic number, because the mean of its divisors is an integer number (4461196536720).
Almost surely, 2120012302102303 is an apocalyptic number.
120012302102303 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
120012302102303 is a deficient number, since it is larger than the sum of its proper divisors (22745987072737).
120012302102303 is a wasteful number, since it uses less digits than its factorization.
120012302102303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 321875759.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 120012302102303 its reverse (303201203210021), we get a palindrome (423213505312324).
The spelling of 120012302102303 in words is "one hundred twenty trillion, twelve billion, three hundred two million, one hundred two thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •