Base | Representation |
---|---|
bin | 11011110100011101001100… |
… | …111000011001010100000000 |
3 | 121001012201221212101222011212 |
4 | 123310131030320121110000 |
5 | 112014103420420311222 |
6 | 1112115424333025252 |
7 | 34525433123503454 |
oct | 3364351470312400 |
9 | 531181855358155 |
10 | 122352023213312 |
11 | 35a92224436462 |
12 | 11880785025228 |
13 | 53369917738a9 |
14 | 222dc25d70664 |
15 | e229cc0d26e2 |
hex | 6f474ce19500 |
122352023213312 has 18 divisors (see below), whose sum is σ = 244226108836458. Its totient is φ = 61176011606528.
The previous prime is 122352023213311. The next prime is 122352023213317. The reversal of 122352023213312 is 213312320253221.
It can be written as a sum of positive squares in only one way, i.e., 87997607535616 + 34354415677696 = 9380704^2 + 5861264^2 .
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122352023213311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 238968795083 + ... + 238968795594.
It is an arithmetic number, because the mean of its divisors is an integer number (13568117157581).
Almost surely, 2122352023213312 is an apocalyptic number.
It is an amenable number.
122352023213312 is a deficient number, since it is larger than the sum of its proper divisors (121874085623146).
122352023213312 is an frugal number, since it uses more digits than its factorization.
122352023213312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 477937590693 (or 477937590679 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 32.
Adding to 122352023213312 its reverse (213312320253221), we get a palindrome (335664343466533).
The spelling of 122352023213312 in words is "one hundred twenty-two trillion, three hundred fifty-two billion, twenty-three million, two hundred thirteen thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •