Base | Representation |
---|---|
bin | 10111001100101000101000… |
… | …010111001100111010001011 |
3 | 111101020100001022021102201010 |
4 | 113030220220113030322023 |
5 | 101333022240030220021 |
6 | 1000552512041255003 |
7 | 30326641143120102 |
oct | 2714505027147213 |
9 | 441210038242633 |
10 | 102023330320011 |
11 | 2a56494024a771 |
12 | b53897aa94463 |
13 | 44c09b3021aa9 |
14 | 1b29d53db7039 |
15 | bbdcdaaa9976 |
hex | 5cca285cce8b |
102023330320011 has 16 divisors (see below), whose sum is σ = 138373073311104. Its totient is φ = 66849153543744.
The previous prime is 102023330320001. The next prime is 102023330320019. The reversal of 102023330320011 is 110023033320201.
It is not a de Polignac number, because 102023330320011 - 214 = 102023330303627 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 102023330320011.
It is not an unprimeable number, because it can be changed into a prime (102023330320019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 572798946 + ... + 572977031.
It is an arithmetic number, because the mean of its divisors is an integer number (8648317081944).
Almost surely, 2102023330320011 is an apocalyptic number.
102023330320011 is a deficient number, since it is larger than the sum of its proper divisors (36349742991093).
102023330320011 is a wasteful number, since it uses less digits than its factorization.
102023330320011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1145776490.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 102023330320011 its reverse (110023033320201), we get a palindrome (212046363640212).
The spelling of 102023330320011 in words is "one hundred two trillion, twenty-three billion, three hundred thirty million, three hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •