Base | Representation |
---|---|
bin | 11101110001111010110… |
… | …00010111000000000101 |
3 | 10121211010210112221002210 |
4 | 32320331120113000011 |
5 | 113231034343343133 |
6 | 2102022153054033 |
7 | 133632433412211 |
oct | 16707530270005 |
9 | 3554123487083 |
10 | 1023232012293 |
11 | 364a4a882657 |
12 | 1463863b7319 |
13 | 7564b43cb8a |
14 | 3774ba8b941 |
15 | 1b93b105763 |
hex | ee3d617005 |
1023232012293 has 32 divisors (see below), whose sum is σ = 1390213324800. Its totient is φ = 669301315200.
The previous prime is 1023232012247. The next prime is 1023232012381. The reversal of 1023232012293 is 3922102323201.
It is a happy number.
It is not a de Polignac number, because 1023232012293 - 213 = 1023232004101 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1023232012293.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1023232014293) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 53037793 + ... + 53057081.
It is an arithmetic number, because the mean of its divisors is an integer number (43444166400).
Almost surely, 21023232012293 is an apocalyptic number.
It is an amenable number.
1023232012293 is a deficient number, since it is larger than the sum of its proper divisors (366981312507).
1023232012293 is a wasteful number, since it uses less digits than its factorization.
1023232012293 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20553.
The product of its (nonzero) digits is 7776, while the sum is 30.
Adding to 1023232012293 its reverse (3922102323201), we get a palindrome (4945334335494).
The spelling of 1023232012293 in words is "one trillion, twenty-three billion, two hundred thirty-two million, twelve thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •