Base | Representation |
---|---|
bin | 110111111111001010… |
… | …1010111010010111101 |
3 | 102111100010002020122222 |
4 | 1233332111113102331 |
5 | 3432213132132201 |
6 | 131122230215125 |
7 | 11454303513452 |
oct | 1577625272275 |
9 | 374303066588 |
10 | 120231130301 |
11 | 46a9837a7a7 |
12 | 1b3751b44a5 |
13 | b451050c69 |
14 | 5b67d0d829 |
15 | 31da40d91b |
hex | 1bfe5574bd |
120231130301 has 4 divisors (see below), whose sum is σ = 121027363104. Its totient is φ = 119434897500.
The previous prime is 120231130297. The next prime is 120231130319. The reversal of 120231130301 is 103031132021.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 120231130301 - 22 = 120231130297 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 120231130301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120231133301) 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, 398116175 + ... + 398116476.
It is an arithmetic number, because the mean of its divisors is an integer number (30256840776).
Almost surely, 2120231130301 is an apocalyptic number.
It is an amenable number.
120231130301 is a deficient number, since it is larger than the sum of its proper divisors (796232803).
120231130301 is an equidigital number, since it uses as much as digits as its factorization.
120231130301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 796232802.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 120231130301 its reverse (103031132021), we get a palindrome (223262262322).
The spelling of 120231130301 in words is "one hundred twenty billion, two hundred thirty-one million, one hundred thirty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •