Base | Representation |
---|---|
bin | 101111111110010010… |
… | …1110010011010000000 |
3 | 100211220210002110102021 |
4 | 1133330211302122000 |
5 | 3141442113341112 |
6 | 115154435131224 |
7 | 10304660440132 |
oct | 1377445623200 |
9 | 324823073367 |
10 | 103022012032 |
11 | 3a767270505 |
12 | 17b71a43b14 |
13 | 993a930144 |
14 | 4db4557052 |
15 | 2a2e6ca907 |
hex | 17fc972680 |
103022012032 has 16 divisors (see below), whose sum is σ = 205239164850. Its totient is φ = 51511005952.
The previous prime is 103022012029. The next prime is 103022012077. The reversal of 103022012032 is 230210220301.
It can be written as a sum of positive squares in only one way, i.e., 99972321856 + 3049690176 = 316184^2 + 55224^2 .
It is a tau number, because it is divible by the number of its divisors (16).
It is a super-2 number, since 2×1030220120322 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a junction number, because it is equal to n+sod(n) for n = 103022011997 and 103022012015.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 402429607 + ... + 402429862.
Almost surely, 2103022012032 is an apocalyptic number.
It is an amenable number.
103022012032 is a deficient number, since it is larger than the sum of its proper divisors (102217152818).
103022012032 is an frugal number, since it uses more digits than its factorization.
103022012032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 804859483 (or 804859471 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 103022012032 its reverse (230210220301), we get a palindrome (333232232333).
The spelling of 103022012032 in words is "one hundred three billion, twenty-two million, twelve thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •