Base | Representation |
---|---|
bin | 100110010000000101001111… |
… | …011110110110001010000000 |
3 | 211001122201101012021222101120 |
4 | 212100011033132312022000 |
5 | 134022243344310100412 |
6 | 1353444113442232240 |
7 | 50302165500532140 |
oct | 4620051736661200 |
9 | 731581335258346 |
10 | 168230907503232 |
11 | 49670366573312 |
12 | 16a5033a655680 |
13 | 72b414ccc24b2 |
14 | 2d785c2a64920 |
15 | 146b112d95b8c |
hex | 99014f7b6280 |
168230907503232 has 64 divisors (see below), whose sum is σ = 510700969214400. Its totient is φ = 48065973571584.
The previous prime is 168230907503213. The next prime is 168230907503291. The reversal of 168230907503232 is 232305709032861.
It is a tau number, because it is divible by the number of its divisors (64).
It is a super-2 number, since 2×1682309075032322 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 31292948857 + ... + 31292954232.
It is an arithmetic number, because the mean of its divisors is an integer number (7979702643975).
Almost surely, 2168230907503232 is an apocalyptic number.
168230907503232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
168230907503232 is an abundant number, since it is smaller than the sum of its proper divisors (342470061711168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
168230907503232 is an equidigital number, since it uses as much as digits as its factorization.
168230907503232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 62585903113 (or 62585903101 counting only the distinct ones).
The product of its (nonzero) digits is 3265920, while the sum is 51.
The spelling of 168230907503232 in words is "one hundred sixty-eight trillion, two hundred thirty billion, nine hundred seven million, five hundred three thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •