Base | Representation |
---|---|
bin | 110001100101100111111… |
… | …0111000100101010110100 |
3 | 220010112111100120211020022 |
4 | 1203023033313010222310 |
5 | 1343130221143432322 |
6 | 22254524052224312 |
7 | 1302250423340645 |
oct | 143131767045264 |
9 | 26115440524208 |
10 | 6815305452212 |
11 | 219839a286a04 |
12 | 920a2800b098 |
13 | 3a58b0211b6a |
14 | 197c10b6b6cc |
15 | bc435cc8942 |
hex | 632cfdc4ab4 |
6815305452212 has 6 divisors (see below), whose sum is σ = 11926784541378. Its totient is φ = 3407652726104.
The previous prime is 6815305452191. The next prime is 6815305452217. The reversal of 6815305452212 is 2122545035186.
It can be written as a sum of positive squares in only one way, i.e., 6745167345316 + 70138106896 = 2597146^2 + 264836^2 .
It is a super-2 number, since 2×68153054522122 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6815305452217) 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 as a sum of consecutive naturals, namely, 851913181523 + ... + 851913181530.
It is an arithmetic number, because the mean of its divisors is an integer number (1987797423563).
Almost surely, 26815305452212 is an apocalyptic number.
It is an amenable number.
6815305452212 is a deficient number, since it is larger than the sum of its proper divisors (5111479089166).
6815305452212 is a wasteful number, since it uses less digits than its factorization.
6815305452212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1703826363057 (or 1703826363055 counting only the distinct ones).
The product of its (nonzero) digits is 576000, while the sum is 44.
The spelling of 6815305452212 in words is "six trillion, eight hundred fifteen billion, three hundred five million, four hundred fifty-two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •