Base | Representation |
---|---|
bin | 101110100100110111… |
… | …1000100011001000010 |
3 | 100120011122202200100200 |
4 | 1131021233010121002 |
5 | 3114320424321310 |
6 | 113541004030030 |
7 | 10140423135435 |
oct | 1351157043102 |
9 | 316148680320 |
10 | 100021323330 |
11 | 3946747a695 |
12 | 17474b32316 |
13 | 95800672b6 |
14 | 4babc1181c |
15 | 290604c9c0 |
hex | 1749bc4642 |
100021323330 has 48 divisors (see below), whose sum is σ = 260137031544. Its totient is φ = 26663984640.
The previous prime is 100021323329. The next prime is 100021323359. The reversal of 100021323330 is 33323120001.
100021323330 is a `hidden beast` number, since 10 + 0 + 0 + 2 + 1 + 323 + 330 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 68119434009 + 31901889321 = 260997^2 + 178611^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 116800 + ... + 462260.
Almost surely, 2100021323330 is an apocalyptic number.
100021323330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100021323330 is an abundant number, since it is smaller than the sum of its proper divisors (160115708214).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100021323330 is a wasteful number, since it uses less digits than its factorization.
100021323330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 348691 (or 348688 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 18.
Adding to 100021323330 its reverse (33323120001), we get a palindrome (133344443331).
The spelling of 100021323330 in words is "one hundred billion, twenty-one million, three hundred twenty-three thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •