Base | Representation |
---|---|
bin | 1010101000000110011101… |
… | …00101101110011100111100 |
3 | 10001201222010020101222020020 |
4 | 11110003032211232130330 |
5 | 11030330321022230312 |
6 | 121411052414452140 |
7 | 4631201002261563 |
oct | 524031645563474 |
9 | 101658106358206 |
10 | 23368088086332 |
11 | 749a39457a040 |
12 | 2754a85504050 |
13 | 10067a7c44702 |
14 | 5ab042dc2bda |
15 | 2a7cce5d678c |
hex | 1540ce96e73c |
23368088086332 has 48 divisors (see below), whose sum is σ = 61533523497600. Its totient is φ = 6837058164160.
The previous prime is 23368088086313. The next prime is 23368088086337.
23368088086332 is nontrivially palindromic in base 10.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23368088086337) 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, 3052254282 + ... + 3052261937.
It is an arithmetic number, because the mean of its divisors is an integer number (1281948406200).
Almost surely, 223368088086332 is an apocalyptic number.
23368088086332 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
23368088086332 is an abundant number, since it is smaller than the sum of its proper divisors (38165435411268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23368088086332 is a wasteful number, since it uses less digits than its factorization.
23368088086332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6104516266 (or 6104516264 counting only the distinct ones).
The product of its (nonzero) digits is 47775744, while the sum is 60.
The spelling of 23368088086332 in words is "twenty-three trillion, three hundred sixty-eight billion, eighty-eight million, eighty-six thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •