Base | Representation |
---|---|
bin | 11011010101100101000010… |
… | …110011000110110010001000 |
3 | 120202200220000012012001012111 |
4 | 123111211002303012302020 |
5 | 111224322311343212222 |
6 | 1103412544112152104 |
7 | 34216224645534346 |
oct | 3325450263066210 |
9 | 522626005161174 |
10 | 120230140210312 |
11 | 35344352834530 |
12 | 115994a6838634 |
13 | 5211865b92c02 |
14 | 2199254056996 |
15 | dd76ddb9c777 |
hex | 6d5942cc6c88 |
120230140210312 has 16 divisors (see below), whose sum is σ = 245925286794000. Its totient is φ = 54650063731920.
The previous prime is 120230140210267. The next prime is 120230140210339. The reversal of 120230140210312 is 213012041032021.
It is a super-2 number, since 2×1202301402103122 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 683125796562 + ... + 683125796737.
It is an arithmetic number, because the mean of its divisors is an integer number (15370330424625).
Almost surely, 2120230140210312 is an apocalyptic number.
It is an amenable number.
120230140210312 is an abundant number, since it is smaller than the sum of its proper divisors (125695146583688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120230140210312 is a wasteful number, since it uses less digits than its factorization.
120230140210312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1366251593316 (or 1366251593312 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 120230140210312 its reverse (213012041032021), we get a palindrome (333242181242333).
The spelling of 120230140210312 in words is "one hundred twenty trillion, two hundred thirty billion, one hundred forty million, two hundred ten thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •