Base | Representation |
---|---|
bin | 10111011011001000111101… |
… | …101011010010110010110011 |
3 | 111111202121221022112000122102 |
4 | 113123020331223102302303 |
5 | 102000340201300234303 |
6 | 1003034442342331015 |
7 | 30461646422253041 |
oct | 2733107553226263 |
9 | 444677838460572 |
10 | 103020120321203 |
11 | 2a909651212a88 |
12 | b679ba5a29a6b |
13 | 45639a925a947 |
14 | 1b622b3d91391 |
15 | bd9bca5ea288 |
hex | 5db23dad2cb3 |
103020120321203 has 4 divisors (see below), whose sum is σ = 103020204088008. Its totient is φ = 103020036554400.
The previous prime is 103020120321091. The next prime is 103020120321229. The reversal of 103020120321203 is 302123021020301.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 103020120321203 - 28 = 103020120320947 is a prime.
It is a super-2 number, since 2×1030201203212032 (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 (103020120321233) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 40010726 + ... + 42507627.
It is an arithmetic number, because the mean of its divisors is an integer number (25755051022002).
Almost surely, 2103020120321203 is an apocalyptic number.
103020120321203 is a deficient number, since it is larger than the sum of its proper divisors (83766805).
103020120321203 is an equidigital number, since it uses as much as digits as its factorization.
103020120321203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83766804.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 103020120321203 its reverse (302123021020301), we get a palindrome (405143141341504).
The spelling of 103020120321203 in words is "one hundred three trillion, twenty billion, one hundred twenty million, three hundred twenty-one thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •