Base | Representation |
---|---|
bin | 111001011000010111… |
… | …1000011111001001111 |
3 | 102210001201002111112112 |
4 | 1302300233003321033 |
5 | 4004330344223043 |
6 | 132335230254235 |
7 | 11621416340354 |
oct | 1626057037117 |
9 | 383051074475 |
10 | 123224211023 |
11 | 48293944631 |
12 | 1ba6b65737b |
13 | b80a181c44 |
14 | 5d6d63462b |
15 | 3313087518 |
hex | 1cb0bc3e4f |
123224211023 has 4 divisors (see below), whose sum is σ = 123319660968. Its totient is φ = 123128761080.
The previous prime is 123224211007. The next prime is 123224211037. The reversal of 123224211023 is 320112422321.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 320112422321 = 10337 ⋅30967633.
It is a cyclic number.
It is not a de Polignac number, because 123224211023 - 24 = 123224211007 is a prime.
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 123224211023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123224291023) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 47723036 + ... + 47725617.
It is an arithmetic number, because the mean of its divisors is an integer number (30829915242).
Almost surely, 2123224211023 is an apocalyptic number.
123224211023 is a deficient number, since it is larger than the sum of its proper divisors (95449945).
123224211023 is an equidigital number, since it uses as much as digits as its factorization.
123224211023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95449944.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 123224211023 its reverse (320112422321), we get a palindrome (443336633344).
The spelling of 123224211023 in words is "one hundred twenty-three billion, two hundred twenty-four million, two hundred eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •