Base | Representation |
---|---|
bin | 1110111101011011111… |
… | …11110110110010010000 |
3 | 1211010202221220001111111 |
4 | 13132231333312302100 |
5 | 31410203144243224 |
6 | 1032045423023104 |
7 | 52064621340256 |
oct | 7365577666220 |
9 | 1733687801444 |
10 | 514020306064 |
11 | 188aa4075a01 |
12 | 8375443aa94 |
13 | 39619a19475 |
14 | 1ac432a45d6 |
15 | d586927d94 |
hex | 77adff6c90 |
514020306064 has 100 divisors (see below), whose sum is σ = 1064174617756. Its totient is φ = 240517840896.
The previous prime is 514020306053. The next prime is 514020306113. The reversal of 514020306064 is 460603020415.
It can be written as a sum of positive squares in 10 ways, for example, as 22198616064 + 491821690000 = 148992^2 + 701300^2 .
It is a super-2 number, since 2×5140203060642 (a number of 24 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 257911852 + ... + 257913844.
Almost surely, 2514020306064 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 514020306064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (532087308878).
514020306064 is an abundant number, since it is smaller than the sum of its proper divisors (550154311692).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
514020306064 is an equidigital number, since it uses as much as digits as its factorization.
514020306064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2262 (or 2205 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 31.
Adding to 514020306064 its reverse (460603020415), we get a palindrome (974623326479).
The spelling of 514020306064 in words is "five hundred fourteen billion, twenty million, three hundred six thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •