Base | Representation |
---|---|
bin | 11011010100001000110011… |
… | …100011011101010101010011 |
3 | 120202100102100220221100102110 |
4 | 123110020303203131111103 |
5 | 111221211443122433243 |
6 | 1103255244321120403 |
7 | 34206120436416360 |
oct | 3324106343352523 |
9 | 522312326840373 |
10 | 120131100202323 |
11 | 3530634a286661 |
12 | 11582266489103 |
13 | 52054112232a2 |
14 | 219453a6cb467 |
15 | dd4d43d8ee33 |
hex | 6d42338dd553 |
120131100202323 has 64 divisors (see below), whose sum is σ = 198637061833728. Its totient is φ = 63005635399680.
The previous prime is 120131100202313. The next prime is 120131100202331. The reversal of 120131100202323 is 323202001131021.
It is not a de Polignac number, because 120131100202323 - 26 = 120131100202259 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 120131100202323.
It is not an unprimeable number, because it can be changed into a prime (120131100202313) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 32604561 + ... + 36101517.
It is an arithmetic number, because the mean of its divisors is an integer number (3103704091152).
Almost surely, 2120131100202323 is an apocalyptic number.
120131100202323 is a deficient number, since it is larger than the sum of its proper divisors (78505961631405).
120131100202323 is a wasteful number, since it uses less digits than its factorization.
120131100202323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3499372.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 120131100202323 its reverse (323202001131021), we get a palindrome (443333101333344).
The spelling of 120131100202323 in words is "one hundred twenty trillion, one hundred thirty-one billion, one hundred million, two hundred two thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •