Base | Representation |
---|---|
bin | 100010011011101000… |
… | …110110001111001100 |
3 | 10112102120022001201102 |
4 | 202123220312033030 |
5 | 1101204023233024 |
6 | 24552331002232 |
7 | 2446113406340 |
oct | 423350661714 |
9 | 115376261642 |
10 | 36970914764 |
11 | 14752132513 |
12 | 71b9599378 |
13 | 3642656534 |
14 | 1b0a193620 |
15 | e65aea1ae |
hex | 89ba363cc |
36970914764 has 96 divisors (see below), whose sum is σ = 79734606336. Its totient is φ = 14640030720.
The previous prime is 36970914733. The next prime is 36970914797. The reversal of 36970914764 is 46741907963.
36970914764 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6436934 + ... + 6442674.
It is an arithmetic number, because the mean of its divisors is an integer number (830568816).
Almost surely, 236970914764 is an apocalyptic number.
36970914764 is a gapful number since it is divisible by the number (34) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 36970914764, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (39867303168).
36970914764 is an abundant number, since it is smaller than the sum of its proper divisors (42763691572).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
36970914764 is a wasteful number, since it uses less digits than its factorization.
36970914764 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6015 (or 6013 counting only the distinct ones).
The product of its (nonzero) digits is 6858432, while the sum is 56.
The spelling of 36970914764 in words is "thirty-six billion, nine hundred seventy million, nine hundred fourteen thousand, seven hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •