Base | Representation |
---|---|
bin | 10111010001000000000001… |
… | …110011000011110111110001 |
3 | 111102022000101212112010211201 |
4 | 113101000001303003313301 |
5 | 101402431140220203241 |
6 | 1001342404521411201 |
7 | 30360421350036133 |
oct | 2721000163036761 |
9 | 442260355463751 |
10 | 102323331022321 |
11 | 2a670098886692 |
12 | b586b44639b01 |
13 | 4513083038266 |
14 | 1b3a69325d053 |
15 | bc69e8356931 |
hex | 5d1001cc3df1 |
102323331022321 has 16 divisors (see below), whose sum is σ = 107892171427840. Its totient is φ = 96772867022160.
The previous prime is 102323331022291. The next prime is 102323331022333. The reversal of 102323331022321 is 123220133323201.
It is a happy number.
It is a de Polignac number, because none of the positive numbers 2k-102323331022321 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 102323331022321.
It is not an unprimeable number, because it can be changed into a prime (102323331022021) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 102163456 + ... + 103160158.
It is an arithmetic number, because the mean of its divisors is an integer number (6743260714240).
Almost surely, 2102323331022321 is an apocalyptic number.
It is an amenable number.
102323331022321 is a deficient number, since it is larger than the sum of its proper divisors (5568840405519).
102323331022321 is an equidigital number, since it uses as much as digits as its factorization.
102323331022321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1005916.
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 102323331022321 its reverse (123220133323201), we get a palindrome (225543464345522).
The spelling of 102323331022321 in words is "one hundred two trillion, three hundred twenty-three billion, three hundred thirty-one million, twenty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •