Base | Representation |
---|---|
bin | 1101111100011100101… |
… | …11000000010000000000 |
3 | 1200210201101011220210211 |
4 | 12332032113000100000 |
5 | 30322224204433424 |
6 | 1004035325403504 |
7 | 46421165542642 |
oct | 6761627002000 |
9 | 1623641156724 |
10 | 479129764864 |
11 | 17521a296993 |
12 | 78a37709594 |
13 | 3624939b70a |
14 | 1929352c892 |
15 | c6e37b9b94 |
hex | 6f8e5c0400 |
479129764864 has 99 divisors (see below), whose sum is σ = 972126791037. Its totient is φ = 236031934464.
The previous prime is 479129764847. The next prime is 479129764873. The reversal of 479129764864 is 468467921974.
The square root of 479129764864 is 692192.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 215147545600 + 263982219264 = 463840^2 + 513792^2 .
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 479129764864.
It is an unprimeable number.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 2148563857 + ... + 2148564079.
Almost surely, 2479129764864 is an apocalyptic number.
479129764864 is the 692192-nd square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 479129764864
479129764864 is an abundant number, since it is smaller than the sum of its proper divisors (492997026173).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
479129764864 is an frugal number, since it uses more digits than its factorization.
479129764864 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 660 (or 322 counting only the distinct ones).
The product of its digits is 146313216, while the sum is 67.
The spelling of 479129764864 in words is "four hundred seventy-nine billion, one hundred twenty-nine million, seven hundred sixty-four thousand, eight hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •