Base | Representation |
---|---|
bin | 110111111011101101… |
… | …1111100010100111011 |
3 | 102111001001100021012022 |
4 | 1233313123330110323 |
5 | 3431444021224311 |
6 | 131102534105055 |
7 | 11451400114223 |
oct | 1576733742473 |
9 | 374031307168 |
10 | 120115414331 |
11 | 46a39024670 |
12 | 1b3424ab18b |
13 | b433096c83 |
14 | 5b567cb083 |
15 | 31d01a25db |
hex | 1bf76fc53b |
120115414331 has 16 divisors (see below), whose sum is σ = 135675203040. Its totient is φ = 105335758080.
The previous prime is 120115414303. The next prime is 120115414403. The reversal of 120115414331 is 133414511021.
It is not a de Polignac number, because 120115414331 - 214 = 120115397947 is a prime.
It is a super-2 number, since 2×1201154143312 (a number of 23 digits) contains 22 as substring.
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 120115414331.
It is not an unprimeable number, because it can be changed into a prime (120115414301) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 187775 + ... + 524871.
It is an arithmetic number, because the mean of its divisors is an integer number (8479700190).
Almost surely, 2120115414331 is an apocalyptic number.
120115414331 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
120115414331 is a deficient number, since it is larger than the sum of its proper divisors (15559788709).
120115414331 is a wasteful number, since it uses less digits than its factorization.
120115414331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 338254.
The product of its (nonzero) digits is 1440, while the sum is 26.
Adding to 120115414331 its reverse (133414511021), we get a palindrome (253529925352).
The spelling of 120115414331 in words is "one hundred twenty billion, one hundred fifteen million, four hundred fourteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •