Base | Representation |
---|---|
bin | 11011010010110110110001… |
… | …100100001001111011101011 |
3 | 120202001000000110111111222221 |
4 | 123102312301210021323223 |
5 | 111213241101110013003 |
6 | 1103151000240454511 |
7 | 34166551641152461 |
oct | 3322666144117353 |
9 | 522030013444887 |
10 | 120043020001003 |
11 | 35281a60303750 |
12 | 1156918461a437 |
13 | 51ca015077478 |
14 | 219018276c831 |
15 | dd28db3327bd |
hex | 6d2db1909eeb |
120043020001003 has 8 divisors (see below), whose sum is σ = 130961099321136. Its totient is φ = 109125786931200.
The previous prime is 120043020000977. The next prime is 120043020001061. The reversal of 120043020001003 is 300100020340021.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 120043020001003 - 213 = 120043019992811 is a prime.
It is a super-2 number, since 2×1200430200010032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (120043020001103) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 211265958 + ... + 211833403.
It is an arithmetic number, because the mean of its divisors is an integer number (16370137415142).
Almost surely, 2120043020001003 is an apocalyptic number.
120043020001003 is a deficient number, since it is larger than the sum of its proper divisors (10918079320133).
120043020001003 is a wasteful number, since it uses less digits than its factorization.
120043020001003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 423125165.
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 120043020001003 its reverse (300100020340021), we get a palindrome (420143040341024).
The spelling of 120043020001003 in words is "one hundred twenty trillion, forty-three billion, twenty million, one thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •