Base | Representation |
---|---|
bin | 1110001001101100110… |
… | …1010000101000001000 |
3 | 212020112121010222220220 |
4 | 3202123031100220020 |
5 | 12440403230104112 |
6 | 303404434350040 |
7 | 23364535602111 |
oct | 3423315205010 |
9 | 766477128826 |
10 | 243122113032 |
11 | 94120104a47 |
12 | 3b15112b320 |
13 | 19c0716c8a6 |
14 | baa51a1208 |
15 | 64ce0c198c |
hex | 389b350a08 |
243122113032 has 16 divisors (see below), whose sum is σ = 607805282640. Its totient is φ = 81040704336.
The previous prime is 243122113021. The next prime is 243122113057. The reversal of 243122113032 is 230311221342.
It is a Harshad number since it is a multiple of its sum of digits (24), and also a Moran number because the ratio is a prime number: 10130088043 = 243122113032 / (2 + 4 + 3 + 1 + 2 + 2 + 1 + 1 + 3 + 0 + 3 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 243122112993 and 243122113011.
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, 5065043998 + ... + 5065044045.
It is an arithmetic number, because the mean of its divisors is an integer number (37987830165).
Almost surely, 2243122113032 is an apocalyptic number.
It is an amenable number.
243122113032 is an abundant number, since it is smaller than the sum of its proper divisors (364683169608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
243122113032 is a wasteful number, since it uses less digits than its factorization.
243122113032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10130088052 (or 10130088048 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 243122113032 its reverse (230311221342), we get a palindrome (473433334374).
The spelling of 243122113032 in words is "two hundred forty-three billion, one hundred twenty-two million, one hundred thirteen thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •