Base | Representation |
---|---|
bin | 1001010011010011000001… |
… | …01011011011100011110010 |
3 | 2200102102000021202112020010 |
4 | 10221221200223123203302 |
5 | 10140110304100330422 |
6 | 111300320002155350 |
7 | 4210525352362620 |
oct | 451514053334362 |
9 | 80372007675203 |
10 | 20454256261362 |
11 | 6576668466660 |
12 | 2364209052b56 |
13 | b54a9c408b31 |
14 | 509dc4130510 |
15 | 2570deb18b0c |
hex | 129a60adb8f2 |
20454256261362 has 256 divisors, whose sum is σ = 54911076249600. Its totient is φ = 4916472422400.
The previous prime is 20454256261349. The next prime is 20454256261367. The reversal of 20454256261362 is 26316265245402.
It is not an unprimeable number, because it can be changed into a prime (20454256261367) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 284648014 + ... + 284719862.
It is an arithmetic number, because the mean of its divisors is an integer number (214496391600).
Almost surely, 220454256261362 is an apocalyptic number.
20454256261362 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 20454256261362, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27455538124800).
20454256261362 is an abundant number, since it is smaller than the sum of its proper divisors (34456819988238).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20454256261362 is a wasteful number, since it uses less digits than its factorization.
20454256261362 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 72497.
The product of its (nonzero) digits is 4147200, while the sum is 48.
The spelling of 20454256261362 in words is "twenty trillion, four hundred fifty-four billion, two hundred fifty-six million, two hundred sixty-one thousand, three hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •